Finding a feasible flow in a strongly connected network

Authors:
Bernhard Haeupler;Robert E. Tarjan
Affiliations:
Department of Computer Science, Princeton University, 35 Olden Street, Princeton, NJ 08540-5233, United States;Department of Computer Science, Princeton University, 35 Olden Street, Princeton, NJ 08540-5233, United States and HP Laboratories, Palo Alto CA, United States
Venue:
Operations Research Letters
Year:
2008

Citing 3
Cited 0

Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a linear-time algorithm to find a feasible flow in a strongly connected network with fixed supplies and demands, each summing to a common value that is at most the minimum arc capacity. This algorithm speeds up the Goldberg-Rao maximum flow method by a constant factor.