Solving maximum flow problems on real-world bipartite graphs

ACM Journal of Experimental Algorithmics

Volumn 16, Issue , 2011, Pages

  Negruşeri, Cosmin Silvestru ^a   PAşOI, Mircea Bogdan ^b   Stanley, Barbara ^a   Stein, Clifford ^c   Strat, Cristian George ^b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

^c Columbia University ^*  (United States)

Author keywords

Bipartite graph; Flow; Preflow push; Real world

Indexed keywords

EID: 84855327021     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1963190.2025381     Document Type: Conference Paper

References (18)

1. AHUJA, R.,ORLIN, J., STEIN, C., AND TARJAN, R. 1994. Improved algorithms for bipartite network flow problems. SIAM J. Comput. 23, 5, 906-933.
2. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. AHUJA, R. K. AND ORLIN, J. B. 1989. A fast and simple algorithm for the maximum flow problem. Operations Res. 37, 748-759. (Pubitemid 20599540)
4. AHUJA, R. K., ORLIN, J. B., AND TARJAN, R. 1989. Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939-954.
5. CHERIYAN, J. AND MAHESHWARI, S. N. 1989. Analysis of preflow push algorithms for maximum network flow. SIAM J. Comput. 18, 1057-1086. (Pubitemid 20613568)
6. CHERKASSKY, B. V. AND GOLDBERG, A. V. 1997. On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390-410. (Pubitemid 127708734)
7. CHERKASSKY, B. V., GOLDBERG, A. V.,MARTIN, P., SETUBAL, J. C., AND STOLFI, J. 1998. Augment or push: A computational study of bipartite matching and unit-capacity flow algorithms. ACM J. Exp. Algorithmics 3, 1998.
8. GALLO, G., GRIGORIADIS, M. D., AND TARJAN, R. E. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30-55.
9. GOLDBERG, A. V. 1987. Efficient graph algorithms for sequential and parallel computers. Ph.D. thesis, MIT, Cambridge, MA.
10. GOLDBERG, A. V. AND KENNEDY, R. 1997. Global price updates help. SIAM J. Discrete Math. 10, 4, 551-572. (Pubitemid 127642992)
11. GOLDBERG, A. V. AND TARJAN, R. E. 1988. A new approach to the maximum flow problem. Journal of the ACM 35, 921-940.
12. GOLDBERG, A. V. AND TARJAN, R. E. 1990. Solving minimum-cost flow problems by successive approximation. Mathematics of Operations Research 15, 3, 430-466.
13. GOLDBERG, A. V., TARJAN, R. E., AND TARDOS, E. 1990. Network flow algorithms. In Paths, Flows, and VLSILayout, B. Korte, L. Lov́ asz, H. Prömel, and A. Shriver, Eds. Springer-Verlag, Berlin, 101-164.
14. GOLDERG, A. 2008. The partial augment-relabel algorithm for the maximum flow problem. In Proceedings of the 16th Annual European Symposium on Algorithms. 466-477.
15. GUSFIELD, D.,MARTEL, C., AND FERNANDEZ-BACA, D. 1987. Fast algorithms for bipartite network flow. SIAM J. Comput. 16, 2.
16. IOSSA, A., CERULLI, R., AND GENTILI, M. 2008. Efficient preflow pushy algorithms. Computers and Operations Research 35, 2694-2708.
17. MAZZONI, G., PALLOTTINO, S., AND SCUTELLA, M. 1991. The maximum flow problem: A max-preflow approach. European Journal on Operations Research 53, 257-278. (Pubitemid 21728737)
18. NAKAMURA, A. 2002. Improvements in practical aspects of optimally scheduling web advertising. In Proceedings of the 11th International Conference on World Wide Web (WWW'02). ACM, New York, 536-541.