Multicut in Trees Viewed through the Eyes of Vertex Cover Conference Paper

abstract

• 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.

name of conference

• Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings

authors

• Chen, Jianer

published proceedings

• ALGORITHMS AND DATA STRUCTURES

author list (cited authors)

• Chen, J., Fan, J., Kanj, I. A., Liu, Y., & Zhang, F.

citation count

• 0

complete list of authors

• Chen, Jianer||Fan, Jia-Hao||Kanj, Iyad A||Liu, Yang||Zhang, Fenghui

publication date

• September 2011

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Artificial Intelligence  Journal

keywords

• 46 Information And Computing Sciences

Digital Object Identifier (DOI)

• 10.1007/978-3-642-22300-6_19

International Standard Book Number (ISBN) 13

• 978-3-642-22299-3

start page

• 219

end page

• +

volume

• 6844

URL

• http%3A%2F%2Fdx.doi.org%2F10.1007%2F978-3-642-22300-6_19