Diminishable parameterized problems and strict polynomial kernelization

DOI10.1007/978-3-319-94418-0_17zbMath1485.68116arXiv1611.03739MaRDI QIDQ1670737

Rolf Niedermeier, Henning Fernau, Danny Hermelin, Andreas Krebs, Hendrik Molter, Till Fluschnik

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1611.03739

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization