The multi-multiway cut problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 273-284

  Avidor, Adi ^a   Langberg, Michael ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY;

APPROXIMATION RATIOS; LP-RELAXATION; MINIMUM MULTICUT; MINIMUM TOTAL WEIGHTS; MULTIWAY CUT PROBLEMS; NATURAL GENERALIZATION; OPTIMAL SOLUTIONS; WEIGHTED UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 35048871602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_24     Document Type: Article

References (23)

1. M. Chrikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
2. G. Calinescu, H. Karloff, and Y. Rabani. An improved approximation algorithm for multiway cut. In Proceedings of the 30th Ann. ACM Symp. on Theory of Comp., ACM-SIAM, 1998.
3. J. Cheriyan, H. J. Karloff, and Y. Rabani. Approximating directed multicuts. In Proceedings of IEEE Symposium on Foundations of Computer Science, 2001.
4. W. H. Cunningham and L. Tang. Optimal 3-terminal cuts and linear programming. In Proceedings of IPCO (Lecture Notes in Computer Science 1610), pages 114-125, 1999.
5. E. D. Demaine and N. Immorlica. Correlation clustering with partial information. In Proceedings of APPROX (Lecture Notes in Computer Science 2764), 2003.
6. R. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23:864-894, 1994.
7. R. Downey. Parameterized complexity for the skeptic. In Proceedings of 18th IEEE Conference on Computational Complexity, 2003.
8. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.
9. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
10. U. Feige and M. X. Goemans. Approximating the value of two prover proof systems with applications to Max-2-Sat and Max-Dicut. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems, pages 182-189, 1995.
11. A. Gupta. Improved results for directed multicut. In Proceedings 14th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, pages 454-455, 2003.
12. N. Garg, V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
13. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42:1115-1145, 1995.
14. D. R. Karger, P. Klein, C. Stein, M. Thorup, and N. E. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. In Proceedings of ACM Symposium on the Theory of Computing, pages 668-678, 1999.
15. P. N. Klein, S. A. Plotkin, S. Rao, and S. E. Tardos. New network decompositions theorems with applications. Brown University Technical Report CS-93-30, 1993.
16. P. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica, 15:187-202, 1995.
17. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
18. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
19. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:355-354, 1999.
20. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
21. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995.
22. D. Shmoys. Cut problems and their applications to divide-and-conquer. In D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, PWS Publishing, pages 192-235, 1996.
23. M. Yannakakis, P. C. Kanellakis, S. C. Cosmadakis, and C. H. Papadimitriou. Cutting and partitioning a graph after a fixed pattern. In Proceedings of ICALP (Lecture Notes in Computer Science 154), pages 712-722, 1983.