Combinatorial Optimization — Eureka, You Shrink!

Volume 2570 of the series Lecture Notes in Computer Science pp 31-33


Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

  • Jack EdmondsAffiliated withNational Bureau of Standards
  • , Richard M. KarpAffiliated withUniversity of California

* Final gross prices may vary according to local VAT.

Get Access


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.