Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

  • Jack Edmonds
  • Richard M. Karp
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2570)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ford, L.R. and Fulkerson, D.R. (1962) Flows in Networks, Princeton University Press, 1962.Google Scholar
  2. 2.
    Busacker, R.G. and Saaty, T.L. (1965) Finite Graphs and Networks, McGraw-Hill, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jack Edmonds
    • 1
  • Richard M. Karp
    • 2
  1. 1.National Bureau of StandardsWashington, D.C.USA
  2. 2.University of CaliforniaBerkeleyUSA

Personalised recommendations