eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2009-02-19
183
194
10.4230/LIPIcs.STACS.2009.1824
article
A Polynomial Kernel for Multicut in Trees
Bousquet, Nicolas
Daligault, Jean
Thomasse, Stephan
Yeo, Anders
The {\sc Multicut In Trees} problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer $k$, whether there exists a set of $k$ edges cutting all the requests. This problem was shown to be FPT by Guo and Niedermeyer (2005). They also provided an exponential kernel. They asked whether this problem has a polynomial kernel. This question was also raised by Fellows (2006).
We show that {\sc Multicut In Trees} has a polynomial kernel.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol003-stacs2009/LIPIcs.STACS.2009.1824/LIPIcs.STACS.2009.1824.pdf