Abstract
In the field of parameterized computation and theory, as a pre-processing technique of algorithms, kernelization has received considerable attention. In this paper, we study the kernelization algorithms for several fixed parameter tractable problems, including Co-Path Set, Path-Contractibility and Connected Dominating Set on \(G_7\) Graphs. For these three problems, based on simple observations, we give simple kernelization algorithms with kernel size of \(4k, 3k+4\) and \(O(k^2)\) respectively, which are smaller than the previous corresponding smallest kernels \(6k, 5k+3\), and \(O(k^3)\).
Keywords
- Kernelization Algorithm
- fixed-parameter Tractable Problems
- Edge Deletion Problem
- Edge Contraction
- Kernel Analysis
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61420106009, 61402054).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS 2009, pp. 629–638 (2009)
Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms (2008). (unpublished manuscript)
Cox, D.R., Burmeister, M., Price, E.R., Kim, S., Myers, R.M.: Radiation hybrid mapping: a somatic cell genetic method for constructing high resolution maps of mammalian chromosomes. Science 250, 245–250 (1990)
Dawar, A., Kreutzer, S.: Domination problems in nowhere-dense classes. In: FSTTCS2009, pp. 157–168 (2009)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
Feng, Q., Zhou, Q., Li, S.: Randomized parameterized algorithms for co-path set problem. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 82–93. Springer, Heidelberg (2014)
Fernau, H.: Parameterized algorithmics for linear arrangement problems. Discrete Appl. Math. 156(17), 3166–3177 (2008)
Fernau, H.: Parameterized algorithmics: a graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Germany (2005)
Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: SODA2010, pp. 503–510. SIAM, Philadelphia (2010)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W.H. Freeman, New York (1979)
Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 195–205. Springer, Heidelberg (2008)
Gu, Q., Imani, N.: Connectivity is not a limit for kernelization: planar connected dominating set. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 26–37. Springer, Heidelberg (2010)
Heggernes, P., Hof, P.V.T., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. SIAM J. Discrete Math. 27(4), 2143–2156 (2013)
Heggernes, P., Hof, P.V., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. Algorithmica 68(1), 109–1320 (2014)
Hermelin, D., Mnich, M., van Leeuwen, E.J., Woeginger, G.J.: Domination when the stars are out. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 462–473. Springer, Heidelberg (2011)
Jiang, H., Zhang, C., Zhu, B.: Weak kernels. ECCC Report, TR10-005 (2010)
Lokshtanov, D., Mnich, M., Saurabh, S.: A linear kernel for a planar connected dominating set. Theor. Comput. Sci. 412(23), 2536–2543 (2011)
Luo, W., Wang, J., Feng, Q., Guo, J., Chen, J.: An improved kernel for planar connected dominating set. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 70–81. Springer, Heidelberg (2011)
Marx, D.: Chordal deletion is fixed-parameter tractable. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 37–48. Springer, Heidelberg (2006)
Misra, N., Philip, G., Raman, V., Saurabh, S.: The kernelization complexity of connected domination in graphs with (no) small cycles. Algorithmica 68(2), 504–530 (2014)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)
Richard, C.W., Withers, D.A., Meeker, T.C., Maurer, S., Evans, G.A., Myers, R.M., Cox, D.R.: A radiation hybrid map of the proximal long arm of human chromosome 11 containing the multiple endocrine neoplasia type 1 (MEN-1) and bcl-1 disease loci. Am. J. Hum. Genet. 49(6), 1189 (1991)
Slonim, D., Kruglyak, L., Stein, L., Lander, E.: Building human genome maps with radiation hybrids. J. Comput. Biol. 4, 487–504 (1997)
Zhang, C., Jiang, H., Zhu, B.: Radiation hybrid map construction problem parameterized. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 127–137. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, W., Hu, S. (2015). Smaller Kernels for Several FPT Problems Based on Simple Observations. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-19647-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19646-6
Online ISBN: 978-3-319-19647-3
eBook Packages: Computer ScienceComputer Science (R0)