Cut Tree Algorithms: An Experimental Study

Journal of Algorithms

Volumn 38, Issue 1, 2001, Pages 51-83

  Goldberg, Andrew V ^a,c   Tsioutsiouliklis, Kostas ^b  

^a Intertrust Technologies Corporation   (United States)

^b Princeton University   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008780363     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1136     Document Type: Article

References (19)

1. D. L. Applegate and W. J. Cook, Personal communication, Rice University, 1997.
2. R. J. Anderson and J. C. Setubal. Goldberg's Algorithm for the Maximum Flow in Perspective: A Computational Study, AMS, pp. 1-18, in "Network Flows and Matchings: First DIMACS Implementation Challenge," (D. S. Johnson and C. C. McGeoch, Eds.), 1993.
3. B. V. Cherkassky and A. V. Goldberg, On implementing push-relabel method for the maximum flow problem, Algorithmica 19 (1997), 390-410.
4. C. S. Cherkuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein, Experimental study of minimum cut algorithms, in "Proc. 8th ACM-SIAM Symposium on Discrete Algorithms," pp. 324-333, 1997.
5. U. Derigs and W. Meier, Implementing Goldberg's max-flow algorithm - a computational investigation, in "ZOR - Methods and Models of Operations Research," Vol. 33, pp. 383-403, 1989.
6. R. E. Gomory and T. C. Hu, Multi-terminal network flows, J. SIAM, 9 (1961), 551-570.
7. A. V. Goldberg, "Efficient Graph Algorithms for Sequential and Parallel Computers," PhD Thesis, M.I.T., January 1987. [Also available as Technical Report TR-374, Lab. for Computer Science, M.I.T., 1987]
8. A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, J. Assoc. Comput. Mach. 45 (1998), 753-782.
9. M. Groetschel, Personal communication, ZIB Berlin, 1997.
10. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, J. Assoc. Comput. Mach. 35 (1988), 921-940.
11. D. Gusfield, Very simple methods for all pairs network flow analysis, SIAM J. Comput. 19 (1990), 143-155.
12. J. Hao and J. B. Orlin, A faster algorithm for finding the minimum cut in a directed graph, J. Algorithms 17 (1994), 424-446.
13. T. C. Hu, "Combinatorial Algorithms," Addison-Wesley, Reading, MA, 1982.
14. M. S. Levine, "Experimental Study of Minimum Cut Algorithms," Technical Report MIT-LCS-TR-719, Lab for Computer Science, MIT, 1997.
15. Jr. L. R. Ford and D. R. Fulkerson, "Flows in Networks," Princeton Univ. Press, Princeton, NJ, 1962.
16. H. Nagamochi, T. Ono, and T. Ibaraki, Implementing an efficient minimum capacity cut algorithm, Math. Prog. 67 (1994), 297-324.
17. Q. C. Nguyen and V Venkateswaran, Implementations of Goldberg-Targan Maximum Flow Algorithm, AMS, pp. 19-42, in "Network Flows and Matchings: First DIMACS Implementation Challenge," (D. S. Johnson and C. C. McGeoch, Eds.), 1993.
18. M. Padberg and G. Rinaldi, An efficient algorithm for the minimum capacity cut problem, Math Prog. 41 (1990), 19-36.
19. M. Juenger, G. Rinaldi, and S. Thienel, Practical performance of efficient minimum cut algorithms, in "Proc. 1st Workshop on Algorithm Engineering, Venice, Italy, 1997." [Available at http://www.dsi.unive.it/ wae97/proceedings/.]