论文信息 - A Polynomial Kernel for Multicut in Trees

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.

[1] Michael R. Fellows,et al. On Problems without Polynomial Kernels (Extended Abstract) , 2008, ICALP.

[2] Michael R. Fellows,et al. Open Problems in Parameterized and Exact Computation - IWPEC 2006 , 2006 .

[3] Rolf Niedermeier,et al. Invitation to data reduction and problem kernelization , 2007, SIGA.

[4] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[5] Frédéric Roupin,et al. Minimal multicut and maximal integer multiflow: A survey , 2005, Eur. J. Oper. Res..

[6] Michael R. Fellows,et al. Parameterized Complexity , 1998 .

[7] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .

[8] Jiong Guo,et al. Fixed-parameter tractability and data reduction for multicut in trees , 2005 .

[9] Barry O'Sullivan,et al. A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[10] Jiong Guo,et al. Algorithm design techniques for parameterized graph modification problems , 2006, Ausgezeichnete Informatikdissertationen.

[11] Michael R. Fellows,et al. On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[12] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.