Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2009: Algorithmic Aspects in Information and Management pp 212–225Cite as

Two-Level Push-Relabel Algorithm for the Maximum Flow Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5564))

Abstract

We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow problems. SIAM J. Comp. (to appear)

    Google Scholar 

  2. Babenko, M., Derryberry, J., Goldberg, A.V., Tarjan, R.E., Zhou, Y.: Experimental evaluation of parametric maximum flow algorihtms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 256–269. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE transactions on Pattern Analysis and Machine Intelligence 26(9), 1124–1137 (2004)

    Article  MATH  Google Scholar 

  4. Chandran, B., Hochbaum, D.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem (submitted for publication) (2007)

    Google Scholar 

  5. Cheriyan, J., Maheshwari, S.N.: Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18, 1057–1086 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cherkassky, B.V.: A Fast Algorithm for Computing Maximum Flow in a Network. In: Karzanov, A.V. (ed.) Collected Papers, Combinatorial Methods for Flow Problems, vol. 3, pp. 90–96. The Institute for Systems Studies, Moscow (1979); English translation appears in AMS Trans. 158, 23–30 (1994) (in Russian)

    Google Scholar 

  7. Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19, 390–410 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cherkassky, B.V., Goldberg, A.V., Martin anbd, P., Setubal, J.C., Stolfi, J.: Augment or push? a computational study of bipartite matching and unit capacity flow algorithms. Technical Report 98-036R, NEC Research Institute, Inc. (1998)

    Google Scholar 

  9. Derigs, U., Meier, W.: Implementing Goldberg’s Max-Flow Algorithm — A Computational Investigation. ZOR — Methods and Models of Operations Research 33, 383–403 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Derigs, U., Meier, W.: An Evaluation of Algorithmic Refinements and Proper Data-Structures for the Preflow-Push Approach for Maximum Flow. In: ASI Series on Computer and System Sciences, vol. 8, pp. 209–223. NATO (1992)

    Google Scholar 

  11. Ford, L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Math. 8, 399–404 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gabow, H.N.: Scaling Algorithms for Network Problems. J. of Comp. and Sys. Sci. 31, 148–168 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Goldberg, A.V.: An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms 22, 1–29 (1997)

    Article  MathSciNet  Google Scholar 

  14. Goldberg, A.V., Kennedy, R.: An Efficient Cost Scaling Algorithm for the Assignment Problem. Math. Prog. 71, 153–178 (1995)

    MATH  MathSciNet  Google Scholar 

  15. Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. J. Assoc. Comput. Mach. 45, 753–782 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  17. Goldberg, A.V.: Recent developments in maximum flow algorithms. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol. 1432, pp. 1–10. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Goldberg, A.V.: The Partial Augment–Relabel Algorithm for the Maximum Flow Problem. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 466–477. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Goldfarb, D., Grigoriadis, M.D.: A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Oper. Res. 13, 83–123 (1988)

    Article  MathSciNet  Google Scholar 

  20. Johnson, D.S., McGeoch, C.C.: Network Flows and Matching: First DIMACS Implementation Challenge. In: AMS, Proceedings of the 1-st DIMACS Implementation Challenge (1993)

    Google Scholar 

  21. King, V., Rao, S., Tarjan, R.: A Faster Deterministic Maximum Flow Algorithm. J. Algorithms 17, 447–474 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Mazzoni, G., Pallottino, S., Scutella, M.G.: The Maximum Flow Problem: A Max-Preflow Approach. Eur. J. of Oper. Res. 53, 257–278 (1991)

    Article  MATH  Google Scholar 

  23. Negrus, C.S., Pas, M.B., Stanley, B., Stein, C., Strat, C.G.: Solving maximum flow problems on real world bipartite graphs. In: Proc. 11th International Workshop on Algorithm Engineering and Experiments, pp. 14–28. SIAM, Philadelphia (2009)

    Google Scholar 

  24. Iossa, A., Cerulli, R., Gentili, M.: Efficient Preflow Push Algorithms. Computers & Oper. Res. 35, 2694–2708 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  25. Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Trees. J. Comput. System Sci. 26, 362–391 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  26. Tuncel, L.: On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. Algorithmica 11, 353–359 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research – Silicon Valley, 1065 La Avenida, Mountain View, CA 94062, USA

    Andrew V. Goldberg

Authors
  1. Andrew V. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research – Silicon Valley, 1065 La Avenida, Mountain View, CA 94062, USA

    Andrew V. Goldberg

  2. Rocket Fuel Inc., 350 Marine Parkway, CA 94065, Marina Park Center, USA

    Yunhong Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldberg, A.V. (2009). Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. In: Goldberg, A.V., Zhou, Y. (eds) Algorithmic Aspects in Information and Management. AAIM 2009. Lecture Notes in Computer Science, vol 5564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02158-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02158-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02157-2

  • Online ISBN: 978-3-642-02158-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation