Experimental evaluation of parametric max-flow algorithms

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

Volumn 4525 LNCS, Issue , 2007, Pages 256-269

  Babenko, Maxim ^a   Derryberry, Jonathan ^b   Goldberg, Andrew ^c   Tarjan, Robert ^b,d   Zhou, Yunhong ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c MICROSOFT RESEARCH   (United States)

^d Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; PROBLEM SOLVING; ROBUST CONTROL;

BALANCING ALGORITHMS; MAXIMUM FLOW PROBLEM; REAL-WORLD APPLICATIONS;

PARAMETER ESTIMATION;

EID: 37149016117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_20     Document Type: Conference Paper

References (14)

1. Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow. SIAM Journal on Computing 23(5), 906-933 (1994)
2. Babenko, M.A., Goldberg, A.V.: Experimental evaluation of a parametric flow algorithm. Technical report, Microsoft Research (2006)
3. Balinski, M.L.: On a selection problem. Management Science 17(3), 230-231 (1970)
4. Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19, 390-410 (1997)
5. Eisner, M.J., Severance, D.G.: Mathematical techniques for efficient record segmentation in large shared databases. J. ACM 23(4), 619-635 (1976)
6. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30-55 (1989)
7. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783-797 (1998)
8. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921-940 (1988)
9. Hochbaum, D.S.: The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 1412, pp. 325-337. Springer, Heidelberg (1998)
10. King, V., Rao, S., Tarjan, R.: A Faster Deterministic Maximum Flow Algorithm. J. Algorithms 17, 447-474 (1994)
11. Mamer, J., Smith, S.: Optimizing field repair kits based on job completion rate. Management Science 28(11), 1328-1333 (1982)
12. Rhys, J.M.W.: A selection problem of shared fixed costs and network flows. Management Science 17(3), 200-207 (1970)
13. Tarjan, R., Ward, J., Zhang, B., Zhou, Y., Mao, J.: Balancing applied to maximum network flow problems. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 612-623. Springer, Heidelberg (2006)
14. Zhang, B., Ward, J., Feng, Q.: Simultaneous parametric maximum flow algorithm with vertex balancing. Technical Report HPL-2005-121, HP Labs (2005)