Constant ratio fixed-parameter approximation of the edge multicut problem

Information Processing Letters

Volumn 109, Issue 20, 2009, Pages 1161-1166

  Marx, Dániel ^a   Razgon, Igor ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Fixed parameter algorithms; Graph algorithms; Multicut; Parameterized approximation; Satisfiability problems

Indexed keywords

FIXED-PARAMETER ALGORITHMS; GRAPH ALGORITHMS; MULTICUT; PARAMETERIZED APPROXIMATION; SATISFIABILITY PROBLEMS;

GRAPH THEORY;

APPROXIMATION ALGORITHMS;

EID: 69949090351     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.07.016     Document Type: Article

References (26)

1. Bansal N., Blum A., and Chawla S. Correlation clustering. Machine Learning 56 1-3 (2004) 89-113
2. Bodlaender H.L., Fellows M.R., Heggernes P., Mancini F., Papadopoulos C., and Rosamond F. Clustering with partial information. MFCS '08: Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 5162 (2008), Springer-Verlag, Berlin, Heidelberg 144-155
3. Bousquet N., Daligault J., Thomasse S., and Yeo A. A polynomial kernel for multicut in trees. In: Albers S., and Marion J.-Y. (Eds). 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Leibniz International Proceedings in Informatics vol. 3 (2009), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 183-194
4. Cai L., and Huang X. Fixed-parameter approximation: Conceptual framework and approximability results. Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Computer Science vol. 4169 (2006) 96-108
5. Chawla S., Krauthgamer R., Kumar R., Rabani Y., and Sivakumar D. On the hardness of approximating multicut and sparsest-cut. Comput. Complexity 15 2 (2006) 94-114
6. Chen J., Liu Y., Lu S., O'Sullivan B., and Razgon I. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55 5 (2008)
7. Chen Y., Grohe M., and Grüber M. On parameterized approximability. Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Computer Science vol. 4169 (2006) 109-120
8. Demaine E.D., Emanuel D., Fiat A., and Immorlica N. Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361 2-3 (2006) 172-187
9. Downey R., Fellows M., and McCartin C. Parameterized approximation algorithms. Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Computer Science vol. 4169 (2006) 121-129
10. Downey R.G., and Fellows M.R. Parameterized Complexity. Monographs in Computer Science (1999), Springer, New York
11. Fellows M.R., Hermelin D., Rosamond F.A., and Vialette S. On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410 1 (2009) 53-61
12. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer, Berlin
13. Garg N., Vazirani V.V., and Yannakakis M. Approximate max-flow min-(multi)cut theorems their applications. SIAM J. Comput. 25 2 (1996) 235-251
14. Guo J., Hüffner F., Kenar E., Niedermeier R., and Uhlmann J. Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European J. Oper. Res. 186 2 (2008) 542-553
15. Guo J., and Niedermeier R. Fixed-parameter tractability data reduction for multicut in trees. Networks 46 3 (2005) 124-135
16. Hüffner F., Niedermeier R., and Wernicke S. Techniques for practical fixed-parameter algorithms. The Computer Journal 51 1 (2008) 7-25
17. Khot S. On the power of unique 2-prover 1-round games. Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (2002), ACM, New York 767-775
18. Liu Y., Lu S., Chen J., and Sze S.-H. Greedy localization color-coding: Iimproved matching and packing algorithms. Parameterized and Exact Computation (IWPEC 2006). Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer, Berlin 84-95
19. Marx D. Parameterized graph separation problems. Theoret. Comput. Sci. 351 3 (2006) 394-406
20. D. Marx, Chordal deletion is fixed-parameter tractable, Algorithmica (2008), doi:10.1007/s00453-008-9233-8, in press
21. Marx D. Parameterized complexity approximation algorithms. The Computer Journal 51 1 (2008) 60-78
22. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications vol. 31 (2006)
23. Razgon I., and O'Sullivan B. Almost 2SAT is fixed-parameter tractable. CoRR (2008). abs/0801.1300
24. Razgon I., and O'Sullivan B. Almost 2SAT is fixed-parameter tractable (extended abstract). ICALP '08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part I. Lecture Notes in Computer Science vol. 5125 (2008), Springer-Verlag, Berlin, Heidelberg 551-562
25. Reed B., Smith K., and Vetta A. Finding odd cycle transversals. Oper. Res. Lett. 32 4 (2004) 299-301
26. M. Xiao, Algorithms for multiterminal cuts, In: CSR, 2008 pp. 314-325