Two-level push-relabel algorithm for the maximum flow problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5564 LNCS, Issue , 2009, Pages 212-225

  Goldberg, Andrew V ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM FLOWS; PRACTICAL ALGORITHMS;

ALGORITHMS;

EID: 70350630336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02158-9_19     Document Type: Conference Paper

References (27)

1. Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow problems. SIAM J. Comp. (to appear)
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)
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)
4. Chandran, B., Hochbaum, D.: A computational study of the pseudoflow and pushrelabel algorithms for the maximum flow problem (submitted for publication) (2007)
5. Cheriyan, J., Maheshwari, S.N.: Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18, 1057-1086 (1989)
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);
7. English translation appears in AMS Trans. 158, 23-30 (1994) (in Russian)
8. Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19, 390-410 (1997)
9. 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)
10. Derigs, U., Meier, W.: Implementing Goldberg's Max-Flow Algorithm - A Computational Investigation. ZOR - Methods and Models of Operations Research 33, 383-403 (1989)
11. 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)
12. Ford, L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Math. 8, 399-404 (1956)
13. Gabow, H.N.: Scaling Algorithms for Network Problems. J. of Comp. and Sys. Sci. 31, 148-168 (1985)
14. Goldberg, A.V.: An Effcient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms 22, 1-29 (1997)
15. Goldberg, A.V., Kennedy, R.: An Effcient Cost Scaling Algorithm for the Assignment Problem. Math. Prog. 71, 153-178 (1995)
16. Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. J. Assoc. Comput. Mach. 45, 753-782 (1998)
17. Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. J. Assoc. Comput. Mach. 35, 921-940 (1988)
18. Goldberg, A.V.: Recent developments in maximum flow algorithms. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol. 1432, pp. 1-10. Springer, Heidelberg (1998)
19. 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)
20. 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)
21. 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)
22. King, V., Rao, S., Tarjan, R.: A Faster Deterministic Maximum Flow Algorithm. J. Algorithms 17, 447-474 (1994)
23. Mazzoni, G., Pallottino, S., Scutella, M.G.: The Maximum Flow Problem: A Max-Preflow Approach. Eur. J. of Oper. Res. 53, 257-278 (1991)
24. 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)
25. Iossa, A., Cerulli, R., Gentili, M.: Effcient Preflow Push Algorithms. Computers & Oper. Res. 35, 2694-2708 (2008)
26. Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Trees. J. Comput. System Sci. 26, 362-391 (1983)
27. Tuncel, L.: On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. Algorithmica 11, 353-359 (1994)