Lower Bounds for Kernelization

  • Hans L. BodlaenderEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8894)


Kernelization is the process of transforming the input of a combinatorial decision problem to an equivalent instance, with a guarantee on the size of the resulting instances as a function of a parameter. Recent techniques from the field of fixed parameter complexity and tractability allow to give lower bounds for such kernels. In particular, it is discussed how one can show for parameterized problems that these do not have polynomial kernels, under the assumption that \(coNP \not \subseteq NP/poly\).



This survey would not have been possible without the discussions and cooperation with several collegues: Rod Downey, Mike Fellows, Bart Jansen, Danny Hermelin, Stefan Kratsch, Stéphan Thomassé and Andres Yeo. Thank you very much! I apologize to all whose work was inadvertingly or due to space was not or insufficiently discussed here.


  1. 1.
    Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experimentation and the 1st Workshop on Analytic Algorithmics and Combinatorics, ALENEX/ANALCO 2004, pp. 62–69. ACM-SIAM (2004)Google Scholar
  2. 2.
    Binkele-Raible, D., Fernau, H., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Trans. Algorithms 8(5), 38 (2012)MathSciNetGoogle Scholar
  3. 3.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 423–434 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discrete Math. 27, 2108–2142 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28, 277–305 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255–269 (2008)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Bodlaender, H.L., Koster, A.M.C.A., Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Comput. Intell. 21(3), 286–305 (2005)CrossRefGoogle Scholar
  8. 8.
    Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412, 4570–4578 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077–1106 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72, 1346–1367 (2006)Google Scholar
  11. 11.
    Chen, Y., Flum, J., Müller, M.: Lower bounds for kernelizations and other preprocessing procedures. Theory Comput. Syst. 48(4), 803–839 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, M.: Clique cover and graph separation: new incompressibility results. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 254–265. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  13. 13.
    Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Kernelization hardness of connectivity problems in \(d\)-degenerate graphs. Discrete Appl. Math. 160, 2131–2141 (2012)Google Scholar
  14. 14.
    Dell, H.: A simple proof that AND-compression of NP-complete problems is hard. In: Proceedings IPEC 2014 (2014)Google Scholar
  15. 15.
    Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 68–81 (2012)Google Scholar
  16. 16.
    Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Schulman, L.J. (ed.) Proceedings of the 42nd Annual Symposium on Theory of Computing, STOC 2010, pp. 251–260 (2010)Google Scholar
  17. 17.
    Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)CrossRefGoogle Scholar
  19. 19.
    Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)CrossRefzbMATHGoogle Scholar
  20. 20.
    Drucker, A.: New limits to classical and quantum instance compression. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, FOCS 2012, pp. 609–618 (2012)Google Scholar
  21. 21.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)Google Scholar
  22. 22.
    Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77, 91–106 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Gutin, G., Muciaccia, G., Yeo, A.: Non-existence of polynomial kernels for the test cover problem. Inf. Process. Lett. 113, 123–126 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Harnik, D., Naor, M.: On the compressibility of \(\cal {NP}\) instances and cryptographic applications. SIAM J. Comput. 39, 1667–1713 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Hermelin, D., Kratsch, S., Sołtys, K., Wahlström, M., Wu, X.: A completeness theory for polynomial (Turing) kernelization. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 202–215. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  26. 26.
    Jansen, B.M.P.: On sparsification for computing treewidth. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 216–229. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  27. 27.
    Jansen, B.M.P.: Turing kernelization for finding long paths and cycles in restricted graph classes. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 579–591. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  28. 28.
    Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited - upper and lower bounds for a refined parameter. Theory Comput. Syst. 53, 263–299 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  29. 29.
    Kratsch, S.: Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. ACM Trans. Algorithms 10(4), 19 (2014)MathSciNetGoogle Scholar
  30. 30.
    Kratsch, S., Philip, G., Ray, S.: Point line cover: the easy kernel is essentially tight. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 1596–1606 (2014)Google Scholar
  31. 31.
    Kratsch, S., Pilipczuk, M., Rai, A., Raman, V.: Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 364–375. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  32. 32.
    Kratsch, S., Wahlström, M.: Two edge modification problems without polynomial kernels. Discrete Optim. 10, 193–199 (2013)CrossRefMathSciNetGoogle Scholar
  33. 33.
    Misra, N., Raman, V., Saurabh, S.: Lower bounds on kernelization. Discrete Optim. 8, 110–128 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  34. 34.
    Nemhauser, G.L., Trotter, L.E.: Vertex packing: structural properties and algorithms. Math. Program. 8, 232–248 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  35. 35.
    Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)CrossRefzbMATHGoogle Scholar
  36. 36.
    Thomassé, S.: A \(4k^2\) kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 1–8 (2010)CrossRefMathSciNetGoogle Scholar
  37. 37.
    Yap, H.P.: Some Topics in Graph Theory. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1986)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Information and Computing ScienceUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations