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(k 6) upper bound on the kernel size for multicut, given by Bousquet et al., to O(k 3). We exploit this connection further to present a parameterized algorithm for multicut that runs in time O *(ρ k), where \(\rho = (\sqrt{5} + 1)/2 \approx 1.618\). This improves the previous (time) upper bound of O *(2k), given by Guo and Niedermeier, for the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abu-Khzam, F.A., Collins, R., Fellows, M., Langston, M., Suters, W., Symons, C.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of ALENEX, pp. 62–69 (2004)
Bousquet, N., Daligault, J., Thomassé, S.: Multicut is fpt. In: CoRR, abs/1010.5197, 2010 (to appear in STOC 2011)
Bousquet, N., Daligault, J., Thomassé, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Proceedings of STACS, pp. 183–194 (2009)
Buss, J., Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22, 560–572 (1993)
Costa, M., Letocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research 162(1), 55–69 (2005)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)
Guo, J., Niedermeier, R.: Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3), 124–135 (2005)
Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351(3), 394–406 (2006)
Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: CoRR, abs/1010.3633, 2010 (to appear in STOC 2011)
West, D.B.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Fan, JH., Kanj, I.A., Liu, Y., Zhang, F. (2011). Multicut in Trees Viewed through the Eyes of Vertex Cover. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-22300-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22299-3
Online ISBN: 978-3-642-22300-6
eBook Packages: Computer ScienceComputer Science (R0)