On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
From MaRDI portal
Publication:2849354
DOI10.1007/978-3-642-40450-4_55zbMath1394.68188arXiv1302.3496OpenAlexW2121016502MaRDI QIDQ2849354
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3496
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
On polynomial kernels for sparse integer linear programs ⋮ A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity ⋮ Polynomial kernels for weighted problems ⋮ Parameterized complexity of sparse linear complementarity problems ⋮ On the Complexity of Wafer-to-Wafer Integration
This page was built for publication: On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
