Polynomial kernels for weighted problems
type: Item
instance of: scholarly article
title: Polynomial kernels for weighted problems
title: Polynomial Kernels for Weighted Problems
zbMATH Open document ID: 1353.68122
zbMATH Open document ID: 1353.68121
DOI: 10.1007/978-3-662-48054-0_24
DOI: 10.1016/J.JCSS.2016.06.004
author: Michael Etscheid
author: Stefan Kratsch
author: Matthias Mnich
author: Heiko Röglin
published in: Journal of Computer and System Sciences
published in: Mathematical Foundations of Computer Science 2015
publication date: 2016-11-14T00:00:00Z
publication date: 2015-09-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1507.03439
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6652735
zbMATH DE Number: 6482816
zbMATH Keywords: kernelization for weighted parameterized problems
zbMATH Keywords: FPT
zbMATH Keywords: knapsack
zbMATH Keywords: subset sum
zbMATH Keywords: integer linear programming with bounded variables
MaRDI profile type: Publication
OpenAlex ID: W2230017674
OpenAlex ID: W2510958401
arXiv ID: 1507.03439
cites work: On problems without polynomial kernels
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Crown reductions for the minimum weighted vertex cover problem
cites work: Intersection Theorems for Systems of Sets
cites work: Parameterizing by the number of numbers
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
cites work: On simultaneous approximation in quadratic integer programming
cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
cites work: Which problems have strongly exponential complexity?
cites work: Bin packing with fixed number of bins revisited
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
cites work: Integer Programming with a Fixed Number of Variables
cites work: Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
cites work: Reducing a Target Interval to a Few Exact Queries
cites work: Q4846462
description: scientific article; zbMATH DE number 6482816
alternative label: Polynomial Kernels for Weighted Problems