@inproceedings{f8f0adee4a4541379851071030055518,
title = "Diminishable parameterized problems and strict polynomial kernelization",
abstract = "Kernelization—a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems—plays a central role in parameterized complexity and has triggered an extensive line of research. In this paper we consider a restricted yet natural variant of kernelization, namely strict kernelization, where one is not allowed to increase the parameter of the reduced instance (the kernel) by more than an additive constant. Building on earlier work of Chen, Flum, and M{\"u}ller [CiE 2009, Theory Comput. Syst. 2011], we underline the applicability of their framework by showing that a variety of fixed-parameter tractable problems, including graph problems and Turing machine computation problems, does not admit strict polynomial kernels under the weaker assumption of P ≠ NP. Finally, we study a relaxation of the notion of strict kernels.",
author = "Henning Fernau and Till Fluschnik and Danny Hermelin and Andreas Krebs and Hendrik Molter and Rolf Niedermeier",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 14th Conference on Computability in Europe, CiE 2018 ; Conference date: 30-07-2018 Through 03-08-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-94418-0_17",
language = "American English",
isbn = "9783319944173",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "161--171",
editor = "Miller, {Russell G.} and Florin Manea and Dirk Nowotka",
booktitle = "Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings",
address = "Germany",
}