A Polynomial Kernel for Multicut in Trees
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.
183-194
Regular Paper
Nicolas
Bousquet
Nicolas Bousquet
Jean
Daligault
Jean Daligault
Stephan
Thomasse
Stephan Thomasse
Anders
Yeo
Anders Yeo
10.4230/LIPIcs.STACS.2009.1824
Creative Commons Attribution-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nd/3.0/legalcode