Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 469-478

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

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

fixed parameter tractability; multicut

Indexed keywords

COMPUTATION THEORY; PARAMETERIZATION;

CUT-SET; FIXED-PARAMETER TRACTABILITY; MULTICUTS; PARAMETERIZED; RUNNING TIME; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 79959760912     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993699     Document Type: Conference Paper

References (37)

1. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2):1-37, 2009.
2. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1-3):89-113, 2004.
3. H. L. Bodlaender, M. R. Fellows, P. Heggernes, F. Mancini, C. Papadopoulos, and F. A. Rosamond. Clustering with partial information. Theor. Comput. Sci., 411(7-9):1202-1211, 2010.
4. N. Bousquet, J. Daligault, and S. Thomassé. Multicut is FPT. Manuscript, arXiv:1010.5197, 2010.
5. N. Bousquet, J. Daligault, S. Thomasse, and A. Yeo. A polynomial kernel for multicut in trees. In STACS, pages 183-194, 2009.
6. G. Calinescu, C. G. Fernandes, and B. Reed. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48(2):333-359, 2003.
7. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Comput. Complexity, 15(2):94-114, 2006. (Pubitemid 43938397)
8. J. Chen, Y. Liu, and S. Lu. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica, 55(1):1-13, 2009.
9. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5), 2008.
10. J. Chuzhoy and S. Khanna. Polynomial flow-cut gaps and hardness of directed cut problems. J. ACM, 56(2):1-28, 2009.
11. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23(4):864-894, 1994.
12. E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica. Correlation clustering in general weighted graphs. Theor. Comput. Sci., 361(2-3):172-187, 2006. (Pubitemid 44189103)
13. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, New York, 1999.
14. U. Feige, M. Hajiaghayi, and J. R. Lee. Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput., 38(2):629-657, 2008.
15. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, Berlin, 2006.
16. L. R. Ford, Jr. and D. R. Fulkerson. Maximal flow through a network. Canad. J. Math., 8:399-404, 1956.
17. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput., 25(2):235-251, 1996.
18. G. Gottlob and S. T. Lee. A logical approach to multicut problems. Inf. Process. Lett., 103(4):136-141, 2007. (Pubitemid 46753985)
19. S. Guillemot. Fpt algorithms for path-transversal and cycle-transversal problems. Discrete Optimization, 8(1):61-71, 2011. Parameterized Complexity of Discrete Optimization.
20. J. Guo, F. Hüffner, E. Kenar, R. Niedermeier, and J. Uhlmann. Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European J. Oper. Res., 186(2):542-553, 2008. (Pubitemid 47615326)
21. J. Guo and R. Niedermeier. Fixed-parameter tractability and data reduction for multicut in trees. Networks, 46(3):124-135, 2005. (Pubitemid 41603361)
22. A. Gupta. Improved results for directed multicut. In SODA, pages 454-455, 2003.
23. F. Hüffner, R. Niedermeier, and S. Wernicke. Techniques for practical fixed-parameter algorithms. The Computer Journal, 51(1):7-25, 2008.
24. S. Khot. On the power of unique 2-prover 1-round games. In STOC, pages 767-775, 2002.
25. D. Lokshtanov and D. Marx. Clustering with local restrictions, 2010.
26. D. Marx. Parameterized graph separation problems. In IWPEC, pages 71-82. 2004.
27. D. Marx. Parameterized graph separation problems. Theoretical Computer Science, 351(3):394-406, 2006. (Pubitemid 43207633)
28. D. Marx and I. Razgon. Constant ratio fixed-parameter approximation of the edge multicut problem. Inf. Process. Lett., 109(20):1161-1166, 2009.
29. D. Marx and I. Razgon. Fixed-parameter tractability of multicut parameterized by the size of the cutset. CoRR, abs/1010.3633, 2010.
30. M. Naor, L. J. Schulman, and A. Srinivasan. Splitters and near-optimal derandomization. In FOCS, pages 182-191, 1995.
31. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
32. R. Pichler, S. Rümmele, and S. Woltran. Multicut algorithms via tree decompositions. In CIAC, pages 167-179. 2010.
33. I. Razgon and B. O'Sullivan. Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci., 75(8):435-450, 2009.
34. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004.
35. J. Sherman. Breaking the multicommodity flow barrier for O(√logn)-approximations to sparsest cut. In FOCS, pages 363-372, 2009.
36. M. Xiao. Algorithms for multiterminal cuts. In CSR, pages 314-325, 2008.
37. M. Yannakakis, P. C. Kanellakis, S. S. Cosmadakis, and C. H. Papadimitriou. Cutting and partitioning a graph after a fixed pattern. In ICALP, pages 712-722, 1983.