Abstract
Bounded-Degree Vertex Deletion is a fundamental problem in graph theory that has new applications in computational biology. In this paper, we address a special case of Bounded-Degree Vertex Deletion, the Co-Path/Cycle Packing problem, which asks to delete as few vertices as possible such that the graph of the remaining (residual) vertices is composed of disjoint paths and simple cycles. The problem falls into the well-known class of ’node-deletion problems with hereditary properties’, is hence NP-complete and unlikely to admit a polynomial time approximation algorithm with approximation factor smaller than 2. In the framework of parameterized complexity, we present a kernelization algorithm that produces a kernel with at most 37k vertices, improving on the super-linear kernel of Fellows et al.’s general theorem for Bounded-Degree Vertex Deletion. Using this kernel,and the method of bounded search trees, we devise an FPT algorithm that runs in time O *(3.24k). On the negative side, we show that the problem is APX-hard and unlikely to have a kernel smaller than 2k by a reduction from Vertex Cover.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst. 41(3), 411–430 (2007)
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. J. Algorithms 41(2), 280–301 (2001)
Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol. 4, e1000234 (2008)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Fujito, T.: Approximating node-deletion problems for matroidal properties. J. Algorithms 31, 211–227 (1999)
Fellows, M., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhausser and Trotter’s local optimization theorem. In: Proc. STACS 2009, pp. 409–420 (2009)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Fernau, H., Raible, D.: Search trees: an essay. In: Proc. TAMC 2009, pp. 59–70 (2009)
Jiang, H., Chauve, C., Zhu, B.: Breakpoint distance and PQ-trees. In: Javed, A. (ed.) CPM 2010. LNCS, vol. 6129, pp. 112–124. Springer, Heidelberg (2010)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. J. Comput. System Sci. 74, 335–349 (2008)
Lewis, J., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20, 425–440 (1980)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10, 120 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, ZZ. et al. (2010). A Linear Kernel for Co-Path/Cycle Packing. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)