Improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences

Volumn 60, Issue 3, 2000, Pages 564-574

  Calinescu, Gruia ^a   Karloff, Howard ^a   Rabani, Yuval ^b  

^a Georgia Institute of Technology   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; COMBINATORIAL ALGORITHM; MULTIWAY CUT PROBLEM;

LINEAR PROGRAMMING;

EID: 0034206424     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1687     Document Type: Article

References (24)

1. Ahuja R. K., Magnanti T. L., Orlin J. B. Network Flows. 1993;Prentice-Hall, Englewood Cliffs.
2. Arora S., Karger D., Karpinski M. Polynomial-time approximation schemes for dense instances of NP-hard problems. Proc. 27th ACM STOC. 1995;. p. 284-293.
3. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and hardness of approximation problems. Proc. 33rd IEEE FOCS. 1992;. p. 14-23.
4. Bertsimas D., Teo C., Vohra R. Nonlinear formulations and improved randomized approximation algorithms for multicut problems. Proc. 4th Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. 920:1995;Springer-Verlag, Berlin. p. 29-39.
5. S. Chopra, and, L. H. Owen, Extended formulations for the A-cut problem, preprint, 1994.
6. Chopra S., Rao M. R. On the multiway cut polyhedron. Networks. 21:1991;51-89.
7. Cunningham W. H. The optimal multiterminal cut problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1991;. p. 105-120.
8. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and, M. Yannakakis, The complexity of multiway cuts, extended abstract, 1983.
9. Dahlhaus E., Johnson D. S., Papadimitriou C. H., Seymour P. D., Yannakakis M. The complexity of multiterminal cuts. SIAM J. Comput. 23:1994;864-894.
10. Erdos P., Székely L. A. On weighted multiway cuts in trees. Math Progr. 65:1994;93-105.
11. Ford L. R., Fulkerson D. R. Flows in Networks. 1962;Princeton University Press, Princeton.
12. Frieze A., Kannan R. The regularity lemma and approximation schemes for dense problems. Proc. 37th IEEE FOCS. 1996;. p. 12-20.
13. N. Garg, V. V. Vazirani, and, M. Yannakakis, Multiway cuts in directed and node weighted graphs, manuscript. [Preliminary version appeared in "Proc. 21st ICALP," Lecture Notes in Computer Science, Vol. 820, pp. 487-498, Springer-Verlag, Berlin, 1994].
14. Garg N., Vazirani V. V., Yannakakis M. Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25:1996;235-251.
15. Goldschmidt O., Hochbaum D. S. Polynomial algorithm for the k-cut problem. Proc. 29th IEEE FOCS. 1988;. p. 444-451.
16. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1993;Springer-Verlag, Berlin.
17. 2) algorithm for the planar 3-cut problem. SIAM J. Algebraic and Discrete Methods. 6:1985;707-712.
18. Hu T. C. Integer Programming and Network Flows. 1969;Addison-Wesley, Reading.
19. Karger D. R., Stein C. A new approach to the minimum cut problem. J. Assoc. Comput. Mach. 43:1996;601-640.
20. Naor J., Zosin L. A 2-approximation algorithm for the directed multiway cut problem. Proc 38th IEEE Focs. 1997;. p. 548-553.
21. Nemhauser G. L., Wolsey L. A. Integer and Combinatorial Optimization. 1988;Wiley, New York.
22. Saran H., Vazirani V. V. Finding k-cuts within twice the optimal. Proc. 32nd IEEE FOCS. 1991;. p. 743-751.
23. Shmoys D. B. Computing near-optimal solutions to combinatorial optimization problems. Cook W., Lovász L. Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 20:1995;Amer. Math. Soc. Providence.
24. Stone H. S. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Software Eng. 3:1977;85-93.