TY - GEN
T1 - Diminishable parameterized problems and strict polynomial kernelization
AU - Fernau, Henning
AU - Fluschnik, Till
AU - Hermelin, Danny
AU - Krebs, Andreas
AU - Molter, Hendrik
AU - Niedermeier, Rolf
N1 - Publisher Copyright:
© 2018, Springer International Publishing AG, part of Springer Nature.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - 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ü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.
AB - 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ü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.
UR - https://www.scopus.com/pages/publications/85051123099
U2 - 10.1007/978-3-319-94418-0_17
DO - 10.1007/978-3-319-94418-0_17
M3 - Conference contribution
AN - SCOPUS:85051123099
SN - 9783319944173
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 161
EP - 171
BT - Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings
A2 - Miller, Russell G.
A2 - Manea, Florin
A2 - Nowotka, Dirk
PB - Springer Verlag
T2 - 14th Conference on Computability in Europe, CiE 2018
Y2 - 30 July 2018 through 3 August 2018
ER -