Multicut is FPT

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 459-468

  Bousquet, Nicolas ^a   Daligault, Jean ^a   Thomassé, Stéphan ^a  

^a UNIV MONTPELLIER   (France)

Author keywords

FPT; multicut; parameterized complexity

Indexed keywords

COMPUTATION THEORY;

MULTICUTS; PARAMETERIZED; PARAMETERIZED COMPLEXITY;

GRAPH STRUCTURES;

EID: 79959765708     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993698     Document Type: Conference Paper

References (22)

1. N. Bousquet, J. Daligault, S. Thomassé, and A. Yeo. A polynomial kernel for multicut in trees. In STACS, volume 09001 of Dagstuhl Seminar Proceedings, pages 183-194, 2009.
2. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Comput. Complex., 15(2):94-114, 2006. (Pubitemid 43938397)
3. J. Chen, Y. Liu, and S. Lu. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica, 55(1):1-13, 2009.
4. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. In STOC, pages 177-186, 2008.
5. M.-C. Costa, L. Létocart, and F. Roupin. Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research, 162(1):55-69, 2005.
6. J. Daligault, C. Paul, A. Perez, and S. Thomassé. Reducing multicut to bounded tree-width. http://www.lirmm.fr/~daligault/Reduction.pdf, 2010.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
8. J. Flum and M. Grohe. Parameterized complexity theory. Springer-Verlag New York Inc, 2006.
9. N. Garg, V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In STOC, pages 698-707, 1993.
10. N. Garg, V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Automata, Languages and Programming, volume 820 of Lecture Notes in Computer Science, pages 487-498, 1994.
11. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
12. G. Gottlob and S. Tien Lee. A logical approach to multicut problems. Inf. Process. Lett, 103(4):136-141, 2007. (Pubitemid 46753985)
13. S. Guillemot. FPT algorithms for path-transversals and cycle-transversals problems in graphs. In IWPEC, pages 129-140, 2008.
14. J. Guo, F. Hüffner, E. Kenar, R. Niedermeier, and J. Uhlmann. Complexity and exact algorithms for multicut. In SOFSEM, pages 303-312, 2006.
15. J. Guo and R. Niedermeier. Fixed-parameter tractability and data reduction for multicut in trees. Networks, 46(3):124-135, 2005. (Pubitemid 41603361)
16. D. Marx. Parameterized graph separation problems. Theor. Comput. Sci., 351(3):394-406, 2006. (Pubitemid 43207633)
17. D. Marx, B. O'Sullivan, and I. Razgon. Treewidth reduction for constrained separation and bipartization problems. In STACS, 2010.
18. D. Marx and I. Razgon. Constant ratio fixed-parameter approximation of the edge multicut problem. In ESA, volume 5757 of Lecture Notes in Computer Science, pages 647-658. Springer, 2009.
19. D. Marx and I. Razgon. Fixed-parameter tractability of multicut parameterized by the size of the cutset. In STOC, 2011.
20. H. Nagamochi and T. Ibaraki. Algorithmic Aspects of Graph Connectivity. Cambridge University Press, New York, NY, USA, 1 edition, 2008.
21. R. Niedermeier. Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press, USA, March 2006.
22. N. Robertson and P.D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory, Ser. B, 63(1):65-110, 1995.