Approximating directed multicuts

Combinatorica

Volumn 25, Issue 3, 2005, Pages 251-269

  Cheriyan, Joseph ^a   Karloff, Howard ^b   Rabani, Yuval ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b AT AND T LABS RESEARCH   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21244432290     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-005-0015-5     Document Type: Article

References (33)

1. Y. AUMANN and Y. RABANI: An O(log k) approximate min-cut max-flow theorem and approximation algorithm, SIAM Journal on Computing 27 (1998), 291-301.
2. B. AWERBUCH and D. PELEG: Sparse partitions, in Proc. Foundations of Computer Science '90, pages 503-513.
3. E. DAHLHAUS, D. S. JOHNSON, C. H. PAPADIMITRIOU, P. D. SEYMOUR and M. YANNAKAKIS: The complexity of multiterminal cuts, SIAM Journal on Computing 23 (1994), 864-894.
4. Preliminary version appeared in Proc. Symposium on the Theory of Computing '92.
5. G. EVEN, J. NAOR, S. RAO and B. SCHIEBER: Divide-and-conquer approximation algorithms via spreading metrics, Journal of the ACM 47(4) (2000), 585-616.
6. Preliminary version appeared in Proc. Foundations of Computer Science '95.
7. G. EVEN, J. NAOR, S. RAO and B. SCHIEBER: Fast approximate graph partitioning algorithms, SIAM Journal on Computing 28(6) (1999), 2187-2214.
8. Preliminary version appeared in SODA '97.
9. G. EVEN, J. NAOR, B. SCHIEBER and M. SUDAN: Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica 20 (1998), 151-174.
10. Preliminary version appeared in IPCO '95.
11. L. R. FORD and D. R. FULKERSON: Maximal flow through a network, Canadian Journal of Mathematics 8 (1956), 399-404.
12. N. GARG, V. V. VAZIRANI and M. YANNAKAKIS: Approximate max-flow min(multi)cut theorems and their applications, SIAM Journal on Computing 25 (1996), 235-251.
13. Preliminary version appeared in Proc. Symposium on the Theory of Computing '93.
14. N. GARG, V. V. VAZIRANI and M. YANNAKAKIS: Multiway cuts in directed and node weighted graphs, in Proc. ICALP '94, pages 487-498.
15. T. C. HU: Multicommodity network flows, Operations Research 11 (1963), 344-360.
16. P. KLEIN, A. AGRAWAL, R. RAVI and S. RAO: Approximation through multicommodity flow, Combinatorica 15 (1995), 187-202.
17. Preliminary version appeared in Proc. Foundations of Computer Science '90.
18. P. KLEIN, S. PLOTKIN and S. RAO: Excluded minors, network decomposition, and multicommodity flow; in Proc. Symposium on the Theory of Computing '93, pages 682-690.
19. P. KLEIN, S. PLOTKIN, S. RAO and É. TARDOS: Approximation algorithms for Steiner and directed multicuts, Journal of Algorithms 22 (1997), 241-269.
20. B. KORTE, L. LOVÁSZ, H. J. PRÖMEL and A. SCHRIJVER, editors: Paths, Flows and VLSI-Layout, Springer-Verlag, 1990.
21. F. T. LEIGHTON and S. RAO: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Journal of the ACM 46(6) (1999), 787-832.
22. Preliminary version appeared in Proc. Foundations of Computer Science '88.
23. N. LINIAL, E. LONDON and Y. RABINOVICH: The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995), 215-245.
24. Preliminary version in Proc. Foundations of Computer Science '94.
25. R. J. LIPTON and R. E. TARJAN: A separator theorem for planar graphs, SIAM Journal on Applied Mathematics 36(2) (1979), 177-189.
26. J. NAOR and L. ZOSIN: A 2-approximation algorithm for the directed multiway cut problem, in Proc. Foundations of Computer Science, pages 548-553, 1997.
27. S. PLOTKIN and É. TARDOS: Improved bounds on the max-flow min-cut ratio for multicommodity flows, Combinatorica 15 (1995), 425-434.
28. Preliminary version appeared in Proc. Symposium on the Theory of Computing '93.
29. M. SAKS, A. SAMORODNITSKY and L. ZOSIN: A lower bound on the integrality gap for minimum multicut in directed networks, to appear in Combinatorica.
30. P. D. SEYMOUR: Packing directed circuits fractionally, Combinatorica 15 (1995), 281-288.
31. D. B. SHMOYS: Cut problems and their application to divide-and-conquer, in: D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997.
32. r,r-free graphs, Information Processing Letters 47 (1993), 77-80.
33. M. YANNAKAKIS: Personal communication, February 2000.