Skip to main content
SpringerLink
Log in

Smaller Kernels for Several FPT Problems Based on Simple Observations

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9130))

Included in the following conference series:

  • 769 Accesses

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)\).

This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61420106009, 61402054).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS 2009, pp. 629–638 (2009)

    Google Scholar 

  2. Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms (2008). (unpublished manuscript)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Dawar, A., Kreutzer, S.: Domination problems in nowhere-dense classes. In: FSTTCS2009, pp. 157–168 (2009)

    Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)

    Book  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Fernau, H.: Parameterized algorithmics for linear arrangement problems. Discrete Appl. Math. 156(17), 3166–3177 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fernau, H.: Parameterized algorithmics: a graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Germany (2005)

    Google Scholar 

  9. Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: SODA2010, pp. 503–510. SIAM, Philadelphia (2010)

    Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. 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)

    Article  MATH  MathSciNet  Google Scholar 

  14. Heggernes, P., Hof, P.V., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. Algorithmica 68(1), 109–1320 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. Jiang, H., Zhang, C., Zhu, B.: Weak kernels. ECCC Report, TR10-005 (2010)

    Google Scholar 

  17. Lokshtanov, D., Mnich, M., Saurabh, S.: A linear kernel for a planar connected dominating set. Theor. Comput. Sci. 412(23), 2536–2543 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Chapter  Google Scholar 

  19. Marx, D.: Chordal deletion is fixed-parameter tractable. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 37–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. 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)

    Article  MATH  MathSciNet  Google Scholar 

  21. 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)

    Article  MATH  MathSciNet  Google Scholar 

  22. 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)

    Google Scholar 

  23. Slonim, D., Kruglyak, L., Stein, L., Lander, E.: Building human genome maps with radiation hybrids. J. Comput. Biol. 4, 487–504 (1997)

    Article  Google Scholar 

  24. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, People’s Republic of China

    Wenjun Li & Shuai Hu

Authors
  1. Wenjun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuai Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenjun Li .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Jianxin Wang

  2. Courant Institute, New York University, New York, New York, USA

    Chee Yap

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation