On implementing the push-relabel method for the maximum flow problem

Algorithmica (New York)

Volumn 19, Issue 4, 1997, Pages 390-410

  Cherkassky, B V ^a   Goldberg, A V ^b,c  

^a CENTRAL ECONOMICS AND MATHEMATICS INSTITUTE   (Russian Federation)

^b Stanford University   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

Algorithms; Experimental evaluation; Maximum flows; Network optimization

Indexed keywords

EID: 0000122499     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009180     Document Type: Article

References (25)

1. R. K. Ahuja, J. B. Orlin, and R. E. Tarjan. Improved Time Bounds for the Maximum Flow Problem. SIAM J. Comput., 18:939-954, 1989.
2. R. J. Anderson and J. C. Setubal. Goldberg's Algorithm for the Maximum Flow in Perspective: a Computational Study. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, pages 1-18. AMS, Providence, RI, 1993.
3. J. Cheriyan, T. Hagerup, and K. Mehlhorn. Can a Maximum Flow be Computed in o(nm) Time? In Proc. ICALP, 1990.
4. J. Cheriyan and S. N. Maheshwari. Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput., 18:1057-1086, 1989.
5. B. V. Cherkassky. A Fast Algorithm for Computing Maximum Flow in a Network. In A. V. Karzanov, editor, Collected Papers, Issue 3: Combinatorial Methods for Flow Problems, pages 90-96. The Institute for Systems Studies, Moscow, 1979. In Russian. English translation appears in AMS Translations, Vol. 158, pp. 23-30. AMS, Providence, RI, 1994.
6. B. V. Cherkassky and A. V. Goldberg. On Implementing Push-Relabel Method for the Maximum Flow Problem. Technical Report STAN-CS-94-1523, Department of Computer Science, Stanford University, Stanford, CA, 1994.
7. G. B. Dantzig. Application of the Simplex Method to a Transportation Problem. In T. C. Koopmans, editor, Activity Analysis and Production and Allocation, pages 359-373. Wiley, New York, 1951.
8. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1962.
9. U. Derigs and W. Meier. Implementing Goldberg's Max-Flow Algorithm - A Computational Investigation. ZOR - Methods and Models of Operations Research, 33:383-403, 1989.
10. U. Derigs and W. Meier. An Evaluation of Algorithmic Refinements and Proper Data-Structures for the Preflow-Push Approach for Maximum Flow. NATO ASI Series on Computer and System Sciences, vol. 8, pages 209-223. Nijhoff, The Hague, 1992.
11. E. A. Dinitz. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet Math. Dokl., 11:1277-1280, 1970.
12. J. Edmonds and R. M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. Assoc. Comput. Mach., 19:248-264, 1972.
13. L. R. Ford, Jr., and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
14. A. V. Goldberg. A New Max-Flow Algorithm. Technical Report MIT/LCS/TM-291, Laboratory for Computer Science, M.I.T., Cambridge, MA, 1985.
15. A. V. Goldberg. Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, M.I.T., Cambridge, MA, January 1987.
16. (Also available as Technical Report TR-374, Laboratory for Computer Science, M.I.T., Cambridge, MA, 1987).
17. A. V. Goldberg, É. Tardos, and R. E. Tarjan. Network Flow Algorithms. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Flows, Paths, and VLSI Layout, pages 101-164. Springer-Verlag, Berlin, 1990.
18. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum Flow Problem. In Proc. 18th Annual ACM Symposium on Theory of Computing, pages 136-146, 1986.
19. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum Flow Problem. J. Assoc. Comput. Mach., 35:921-940, 1988.
20. D. Goldfarb and M. D. Grigoriadis. A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Ann. of Oper. Res., 13:83-123, 1988.
21. D. S. Johnson and C. C. McGeoch, editors. Network Flows and Matching: First DIMACS Implementation Challenge. AMS, Providence, RI, 1993.
22. A. V. Karzanov. Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Dokl., 15:434-437, 1974.
23. V. King, S. Rao, and R. Tarjan. A Faster Deterministic Maximum Flow Algorithm. In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 157-164, 1992.
24. Q. C. Nguyen and V. Venkateswaran. Implementations of Goldberg-Tarjan Maximum Flow Algorithm. In D. S. Johnson and C. C. McGeoch, editors, Network Flows and Matching: First DIMACS Implementation Challenge, pages 19-42. AMS, Providence, RI, 1993.
25. R. E. Tarjan. A Simple Version of Karzanov's Blocking Flow Algorithm. Oper. Res. Lett., 2:265-268, 1984.