Polynomial kernels for weighted problems

DOI10.1007/978-3-662-48054-0_24zbMATH Open1353.68122arXiv1507.03439OpenAlexW2230017674MaRDI QIDQ340549FDOQ340549

Authors: Michael Etscheid, Stefan Kratsch, Matthias Mnich, 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)

Abstract: Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations for Subset Sum and Knapsack when parameterized by the number $n$ of items. We answer both questions affirmatively by using an algorithm for compressing numbers due to Frank and Tardos (Combinatorica 1987). This result had been first used by Marx and V'egh (ICALP 2013) in the context of kernelization. We further illustrate its applicability by giving polynomial kernels also for weighted versions of several well-studied parameterized problems. Furthermore, when parameterized by the different item sizes we obtain a polynomial kernelization for Subset Sum and an exponential kernelization for Knapsack. Finally, we also obtain kernelization results for polynomial integer programs.

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

Recommendations

• Reducing a target interval to a few exact queries
• Knapsack problems: a parameterized point of view
• Polynomial-time data reduction for weighted problems beyond additive goal functions
• Kernelization lower bounds through colors and IDs

zbMATH Keywords

subset sumknapsackFPTinteger linear programming with bounded variableskernelization for weighted parameterized problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• On problems without polynomial kernels
• Which problems have strongly exponential complexity?
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
• Intersection Theorems for Systems of Sets
• Kernelization Lower Bounds by Cross-Composition
• An application of simultaneous diophantine approximation in combinatorial optimization
• Kernel bounds for disjoint cycles and disjoint paths
• Bin packing with fixed number of bins revisited
• On simultaneous approximation in quadratic integer programming
• Crown reductions for the minimum weighted vertex cover problem
• Reducing a target interval to a few exact queries
• Title not available (Why is that?)
• Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

This page was built for publication: Polynomial kernels for weighted problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340549)