114 citations · 306 across the 50 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
Stefan Kratsch
We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs…
cs.CC2013★ 6 cited
On Polynomial Kernels for Sparse Integer Linear Programs
Stefan Kratsch
Integer linear programs (ILPs) are a widely applied framework for dealing with combinatorial problems that arise in practice. It is known, e.g., by the success of CPLEX, that prepr…