Polynomial kernels for weighted problems
From MaRDI portal
Publication:340549
DOI10.1016/j.jcss.2016.06.004zbMath1353.68122arXiv1507.03439MaRDI QIDQ340549
Stefan Kratsch, Matthias Mnich, Michael Etscheid, Heiko Röglin
Publication date: 14 November 2016
Published in: Journal of Computer and System Sciences, Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03439
knapsack; subset sum; FPT; integer linear programming with bounded variables; kernelization for weighted parameterized problems
68Q25: Analysis of algorithms and problem complexity