We take a new look at the multicut problem in trees through the eyes of the vertex cover problem. This connection, together with other techniques that we develop, allows us to significantly improve the O(k6) upper bound on the kernel size for multicut, given by Bousquet et al., to O(k3). We exploit this connection further to present a parameterized algorithm for multicut 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. © 2011 Springer-Verlag.
CITATION STYLE
Chen, J., Fan, J. H., Kanj, I. A., Liu, Y., & Zhang, F. (2011). Multicut in trees viewed through the eyes of vertex cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 219–230). https://doi.org/10.1007/978-3-642-22300-6_19
Mendeley helps you to discover research relevant for your work.