Theoretical improvements in algorithmic efficiency for network flow problems

Authors:
Jack Edmonds;Richard M. Karp
Affiliations:
National Bureau of Standards, Washington, D.C.;University of California, Berkeley, CA
Venue:
Combinatorial optimization - Eureka, you shrink!
Year:
2003

Citing 0
Cited 1

Distributed tracking in a large-scale network of smart cameras

Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum-cost flow problem. Upper bounds on the number of steps in these algorithms are derived, and are shown to improve on the upper bounds of earlier algorithms.