On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility

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. Our main results are as follows: First, we show that the ILP Feasibility problem admits no polynomial kernelization when parameterized by both the number of variables and the number of constraints, unless NP ⊆ coNP/poly. This extends to the restricted cases of bounded variable degree and bounded number of variables per constraint, and to covering and packing ILPs. Second, we give a polynomial kernelization for the Cover ILP problem, asking for a solution to Ax ≥ b with c T x ≤ k, parameterized by k, when A is row-sparse; this generalizes a known polynomial kernelization for the special case with 0/1-variables and coefficients (d-Hitting Set).

[1]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2011, J. Comput. Syst. Sci..

[2]  Hans L. Bodlaender,et al.  Vertex Cover Kernelization Revisited , 2010, Theory of Computing Systems.

[3]  Hans L. Bodlaender,et al.  Vertex Cover Kernelization Revisited , 2010, Theory of Computing Systems.

[4]  Xi Wu,et al.  Hierarchies of Inefficient Kernelizability , 2011, ArXiv.

[5]  Martin W. P. Savelsbergh,et al.  Integer-Programming Software Systems , 2005, Ann. Oper. Res..

[6]  Saket Saurabh,et al.  Kernelization - Preprocessing with a Guarantee , 2012, The Multivariate Algorithmic Revolution and Beyond.

[7]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[8]  Faisal N. Abu-Khzam,et al.  A kernelization algorithm for d-Hitting Set , 2010, J. Comput. Syst. Sci..

[9]  P. Erdös,et al.  Intersection Theorems for Systems of Sets , 1960 .

[10]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Moni Naor,et al.  On the Compressibility of NP Instances and Cryptographic Applications , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[13]  Moni Naor,et al.  On the Compressibility of NP Instances and Cryptographic Applications , 2010, SIAM J. Comput..

[14]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Saket Saurabh,et al.  Incompressibility through Colors and IDs , 2009, ICALP.

[16]  Anders Yeo,et al.  Kernel bounds for disjoint cycles and disjoint paths , 2009, Theor. Comput. Sci..

[17]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[18]  Stefan Kratsch,et al.  Cross-Composition: A New Technique for Kernelization Lower Bounds , 2011, STACS.

[19]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[20]  Erik Jan van Leeuwen,et al.  Reducing a Target Interval to a Few Exact Queries , 2012, MFCS.

[21]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[22]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[23]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[24]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[25]  H. L. Abbott,et al.  Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.