Multicut in trees viewed through the eyes of vertex cover

摘要

We take a new look at the multicut problem in trees, denoted multicut on trees henceforth, through the eyes of the vertex cover problem. This connection, together with other techniques that we develop, allows us to give an upper bound of O(k3) on the kernel size for multicut on trees, significantly improving the O(k6) upper bound given by Bousquet et al. We exploit this connection further to present a parameterized algorithm for multicut on trees that runs in time O⁎(ρk), where ρ=(5+1)/2≈1.618. This improves the previous (time) upper bound of O⁎(2k), given by Guo and Niedermeier, for the problem.