An O(log k) approximate min-cut max-flow theorem and approximation algorithm

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 291-301

  Aumann, Yonatan ^a,b   Rabani, Yuval ^b,c  

^a BAR ILAN UNIVERSITY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Cuts; Multicommodity flow; Network flow; Sparse cuts

Indexed keywords

EID: 0000927271     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794285983     Document Type: Article

References (35)

1. G. M. ADELSON-WELSKY, E. A. DINITS, AND A. V. KARZANOV, Flow Algorithms, Nauka, Moscow, 1975 (in Russian).
2. 1-embeddability, complexity and multicommodity flows, Networks, 21 (1991), pp. 595-617.
3. J. BOURGAIN, On Lipschitz embedding of finite metric spaces in Hilbert space, Israel J. Math., 52 (1985), pp. 46-52.
4. p, Ann. Inst. H. Poincaré, 2 (1966), pp. 231-259.
5. E. DAHLHAUS, D. S. JOHNSON, C. H. PAPADIMITRIOU, P. D. SEYMOUR, AND M. YANNAKAKIS, The complexity of multiway cuts, in Proc. of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 241-251.
6. M. DEZA AND M. LAURENT, Applications of Cut Polyhedra, Technical report BS-R9221, CWI, Amsterdam, 1992.
7. P. ELIAS, A. FEINSTEIN, AND C. E. SHANNON, A note on the maximum flow through a network, IRS Trans. Inform. Theory, 2 (1956), pp. 117-119.
8. L. R. FORD AND D. R. FULKERSON, Maximal flow through a network, Canadian J. Math., 8 (1956), pp. 399-404.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
10. N. GARG, A Deterministic O(log k)-Approximation Algorithm for Sparsest-Cut, 1995, preprint.
11. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, in Proc. 20th International Colloquium on Automata, Languages, and Programming, (ICALP '93), Springer-Verlag, New York, 1993, pp. 64-75.
12. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Approximate max-flow min-(multi)cut theorems and their applications, in Proc. of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 698-707.
13. M. X. GOEMANS AND D. P. WILLIAMSON, .878-approximation algorithms for MAX CUT and MAX 2SAT, in Proc. of the 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 422-431.
14. T. C. HU, Multicommodity network flows, Oper. Res., 11 (1963), pp. 344-360.
15. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, in Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 2-13.
16. P. KLEIN, A. AGRAWAL, R. RAVI, AND S. RAO, Approximation through multicommodity flow, in Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 726-737.
17. P. KLEIN, S. PLOTKIN, AND S. RAO, Excluded minors, network decomposition, and multicommodity flow, in Proc. of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 682-690.
18. B. KORTE, L. LOVÁSZ, H. J. PROMEL, AND A. SCHRIJVER, eds., Paths, Flows, and VLSI-Layout, Springer-Verlag, New York, 1990.
19. F. T. LEIGHTON, F. MAKEDON, S. PLOTKIN, C. STEIN, É. TARDOS, AND S. TRAGOUDAS, Fast approximation algorithms for multicommodity flow problems, in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 101-111; J Comput. System Sci., 50 (1995), pp. 228-243.
20. F. T. LEIGHTON, F. MAKEDON, S. PLOTKIN, C. STEIN, É. TARDOS, AND S. TRAGOUDAS, Fast approximation algorithms for multicommodity flow problems, in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 101-111; J Comput. System Sci., 50 (1995), pp. 228-243.
21. F. T. LEIGHTON AND S. RAO, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in Proc. of the 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 422-431.
22. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, in Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 577-591.
23. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215-245.
24. M. LOMONOSOV, Combinatorial approaches to multiflow problems, Discrete Appl. Math., 11 (1985), pp. 1-93.
25. G. A. MARGULIS, Explicit constructions of concentrators, Problems Inform. Transmission, 9 (1975), pp. 325-332.
26. J. MATOUŠEK, Note on bi-Lipschitz embeddings into normed spaces, Commentationes Mathematicae Univ. Carolinae, 33 (1992), pp. 51-55.
27. H. OKAMURA AND P. D. SEYMOUR, Multicommodity flows in planar graphs, J. Combin. Theory Ser. B, 31 (1989), pp. 75-81.
28. S. PLOTKIN AND É. TARDOS, Improved bounds on the max-flow min-cut ratio for multicommodity flows, in Proc. of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 691-697.
29. B. ROTHSCHILD AND A. WHINSTON, On two-commodity network flows, Oper. Res., 14 (1966), pp. 377-387.
30. P. D. SEYMOUR, Four terminous flows, Networks, 10 (1980), pp. 79-86.
31. P. D. SEYMOUR, Matroids and multicommodity flows, European J. Combin., 2 (1981), pp. 257-290.
32. F. SHAHROKHI AND D. W. MATULA, The maximum concurrent flow problem, J. ACM, 37 (1990), pp. 318-334.
33. S. TRAGOUDAS, VLSI Partitioning Approximation Algorithms Based on Multicommodity Flow and Other Techniques, Ph.D. thesis, University of Texas at Dallas, 1991.
34. J. H. WELLS AND L. R. WILLIAMS, Embeddings and Extensions in Analysis, Springer-Verlag, New York, 1975.
35. 3L) potential reduction algorithm for linear programming, Math. Programming, 50 (1991), pp. 239-258.