Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems | SpringerLink
Skip to main content
Springer Nature Link
Log in

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

  • Chapter
  • First Online:
Combinatorial Optimization — Eureka, You Shrink!

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2570))

  • 4089 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ford, L.R. and Fulkerson, D.R. (1962) Flows in Networks, Princeton University Press, 1962.

    Google Scholar 

  2. Busacker, R.G. and Saaty, T.L. (1965) Finite Graphs and Networks, McGraw-Hill, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Bureau of Standards, Washington, D.C., USA

    Jack Edmonds

  2. University of California, Berkeley, CA, USA

    Richard M. Karp

Authors
  1. Jack Edmonds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard M. Karp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstr. 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Informatik, Universität Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany

    Gerhard Reinelt

  3. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, CNR, viale Manzoni 30, 00185, Rome, Italy

    Giovanni Rinaldi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Edmonds, J., Karp, R.M. (2003). Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36478-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00580-3

  • Online ISBN: 978-3-540-36478-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics