Approximate max-integral-flow/min-multicut theorems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 539-545

  Obata, Kenji ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; FUNCTIONS; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ARBITRARY GRAPHS; DISCRETE STRUCTURES; INTEGRAL FLOW;

GRAPH THEORY;

EID: 4544240239     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007433     Document Type: Conference Paper

References (20)

1. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing. 27(1):291-301, 1998.
2. A. Bogdanov, K. Obata, and L. Trevisan. A lower bound for testing 3-colorability. In IEEE Symposium on Foundations of Computer Science, pages 93-102, 2002.
3. B. Bollobás, P. Erdös, M. Simonovits, and E. Szemerédi. Extremal graphs without large forbidden subgraphs. Annals of Discrete Mathematics, 3:29-41, 1978.
4. C. Chekuri and S. Khanna. Edge disjoint paths revisited. In ACM-SIAM Symposium on Discrete Algorithms, pages 628-637, 2003.
5. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23:864-894, 1994.
6. L. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8, 1956.
7. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In ACM Symposium on Theory of Computing, pages 698-707, 1993.
8. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
9. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
10. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In ACM Symposium on Theory of Computing, pages 406-415, 1997.
11. O. Günlük. A new min-cut max-flow ratio for multicommodity flows. In Integer Programming and Combinatorial Optimization, pages 54-66, 2002.
12. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103, New York, NY, 1972. Plenum Press.
13. P. Klein, S. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In ACM Symposium on Theory of Computing, pages 682-690, 1993.
14. J. Kleinberg. Approximation algorithms for disjoint paths problems. Ph.D. Thesis, MIT, Cambridge, MA, 1996.
15. S. G. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packing integer programs. In Integer Programming and Combinatorial Optimization, 1998.
16. J. Komlós. Covering odd cycles. Combinatoria, pages 393-400, 1997.
17. F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms. Journal of the ACM, 46(6), 1999.
18. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
19. S. Plotkin and E. Tardos. Improved bounds on the max-flow min-cut ratio for multicommodity flows. In ACM Symposium on Theory of Computing, pages 691-697, 1993.
20. K. Varadarajan and G. Venkataraman. Graph decomposition and a greedy algorithm for edge-disjoint paths. In ACM-SIAM Symposium on Discrete Algorithms, 2004.