Solving maximum flow problems on real world bipartite graphs

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009

Volumn , Issue , 2009, Pages 14-28

  Negruşeri, Cosmin Silvestru ^a   Paşoi, Mircea Bogdan ^a,b   Stanley, Barbara ^a   Stein, Clifford ^a,c   Strat, Cristian George ^a,b,d  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

^c Och Spine at New York Presbyterian Hospitals   (United States)

^d NONE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; FLOW GRAPHS; VIRTUAL REALITY;

BIPARTITE GRAPHS; BIPARTITE NETWORK; MAXIMUM FLOW PROBLEMS; MAXIMUM-FLOW ALGORITHM; REAL-WORLD; REAL-WORLD PROBLEM; ROBUST PERFORMANCE; RUNNING TIME;

ALGORITHMS;

EID: 84959888312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R. K. Ahuja and J. B. Orlin. A fast and simple algorithm for the maximum flow problem. Operations Research, 37:748-759, 1989.
3. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow problems. To appear in SIAM Journal on Computing.
4. R. K. Ahuja, J. B. Orlin, and R. Tarjan. Improved time bounds for the maximum flow problem. SIAM J. Comput., 18:939-954, 1989.
5. J. Cheriyan and S. N. Maheshwari. Analysis of preflow push algorithms for maximum network flow. SIAM Journal on Computing, 18:1057-1086, 1989.
6. B. V. Cherkassky and A. V. Goldberg. On implementing push-relabel method for the maximum flow problem. Algorithmica, 19:390-410, 1997.
7. B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi. Augment or push: A computational study of bipartite matching and unit-capacity flow algorithms. ACM J. Exp. Algorithmics, 3:1998, 1998.
8. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing, 18:30-55, 1989.
9. A. V. Goldberg. Efficient graph algorithms for sequential and parallel computers. PhD thesis, MIT, Cambridge, MA, Jan. 1987.
10. A. V. Goldberg and R. Kennedy. Global price updates help. SIAM J. Discrete Math., 10(4):551-572, 1997.
11. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
12. A. V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
13. A. V. Goldberg, R. E. Tarjan, and E. Tardos. Network flow algorithms. In B. Korte, L. Lovász, H. Prömel, and A. Shriver, editors, Paths, Flows, and VLSI-Layout, pages 101-164. Springer-Verlag, Berlin, 1990.
14. D. Gusfield, C. Martel, and D. Fernandez-Baca. Fast algorithms for bipartite network flow. SIAM J. Comput., 16(2), Apr. 1987.
15. A. Nakamura. Improvements in practical aspects of optimally scheduling web advertising. In WWW '02: Proceedings of the 11th international conference on World Wide Web, pages 536-541, New York, NY, USA, 2002. ACM.