Skip to main content
SpringerLink
Log in

On Problems without Polynomial Kernels (Extended Abstract)

  • Conference paper
Automata, Languages and Programming (ICALP 2008)

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

Included in the following conference series:

Abstract

Kernelization is a central technique used in parameterized algorithms, and in other approaches for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions. These problems include k -Path, k -Cycle, k -Exact Cycle, k -Short Cheap Tour, k -Graph Minor Order Test, k -Cutwidth, k -Search Number, k -Pathwidth, k -Treewidth, k -Branchwidth, and several optimization problems parameterized by treewidth or cliquewidth.

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 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alber, J., Fellows, M.R., Niedermeier, R.: Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 150–159. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color coding. Journal of the ACM 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey. BIT Numerical Mathematics 25(1), 2–23 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bodlaender, H.L.: A cubic kernel for feedback vertex set. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 320–331. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Bonsma, P.S., Brüggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259–268. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Buhrman, H.: Private communication (2007)

    Google Scholar 

  8. Burrage, K., Estivill-Castro, V., Fellows, M.R., Langston, M.A., Mac, S., Rosamond, F.A.: The undirected feedback vertex set problem has a Poly(k) kernel. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 192–202. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of paramterized tractability. Annals of Pure and Applied Logic 84(1), 119–138 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Cai, L., Juedes, D.W.: Subexponential parameterized algorithms collapse the W-hierarchy. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 273–284. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Chen, Y., Flum, J., Müller, M.: Lower Bounds for Kernelizations – (manuscript, 2007)

    Google Scholar 

  12. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  13. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Proceedings of the 6th annual ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 632–640 (1995)

    Google Scholar 

  14. Fellows, M.R., Langston, M.A.: Nonconstructive proofs of polynomial-time complexity. Information Processing Letters 26, 157–162 (1988)

    Article  MATH  Google Scholar 

  15. Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM Journal of Discrete Math. 5(1), 117–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fernau, H.: Parameterized algorithms: A graph-theoretic approach. PhD thesis, University of Tübingen (2005)

    Google Scholar 

  17. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  18. Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and log2n nondeterministic bits. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 555–567. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Proceedings of the 40th Symposium on the Theory of Computing (STOC) (to appear, 2008)

    Google Scholar 

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

    MATH  Google Scholar 

  21. Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Mathematical Systems Theory 38, 373–392 (2005)

    Article  MATH  Google Scholar 

  22. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31–45 (2007)

    Article  Google Scholar 

  23. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36–48. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. In: Proceedings of 47th annual IEEE symposium on Foundations Of Computer Science (FOCS), pp. 719–728 (2006)

    Google Scholar 

  25. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 58–67. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Ko, K.: On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences 26(2), 209–221 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  27. Liu, Y., Lu, S., Chen, J., Sze, S.: Greedy localization and color-coding: Improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84–95. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1, 89–102 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  29. Plehn, J., Voigt, B.: Finding minimally weighted subgraphs. In: Möhring, R.H. (ed.) WG 1990. LNCS, vol. 484, pp. 18–29. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  30. Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the 28th annual ACM Symposium on the Theory Of Computing (STOC), pp. 571–575 (1996)

    Google Scholar 

  31. Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science 3, 1–22 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, 3508, TB Utrecht, 80.089, Netherlands

    Hans L. Bodlaender

  2. School of Mathematics, Statistics and Computer Science, Victoria University of Wellington, Wellington, 600, New Zealand

    Rodney G. Downey

  3. The University of Newcastle, Callaghan, NSW 2308, Australia

    Michael R. Fellows

  4. The University of Haifa, Haifa, 31905, Israel

    Danny Hermelin

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rodney G. Downey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael R. Fellows
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Danny Hermelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Luca Aceto

  2. Department of Computer Science, IT-Parken, University of Aarhus, Ã…bogade 34, 8200, Ã…rhusN, Denmark

    Ivan Damgård

  3. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, UK

    Leslie Ann Goldberg

  4. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavik, Iceland

    Magnús M. Halldórsson

  5. Department of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Anna Ingólfsdóttir

  6. Université de Bordeaux-1, LaBRI, 351, Cours de la Libération, 33405, Talence cedex, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D. (2008). On Problems without Polynomial Kernels (Extended Abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70575-8_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70574-1

  • Online ISBN: 978-3-540-70575-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation