Approximating integer programs with positive right-hand sides

We study minimisation of integer linear programs with positive right-hand sides. We show that such programs can be approximated within the maximum absolute row sum of the constraint matrix A whenever the variables are allowed to take values in N. This result is optimal under the unique games conjecture. When the variables are restricted to bounded domains, we show that finding a feasible solution is NP-hard in almost all cases.

[1]  Deeparnab Chakrabarty,et al.  Approximability of Sparse Integer Programs , 2009, Algorithmica.

[2]  Dimitris Bertsimas,et al.  Rounding algorithms for covering problems , 1998, Math. Program..

[3]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[4]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[5]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[6]  Dorit S. Hochbaum,et al.  A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[7]  Joseph Naor,et al.  Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality , 1993, Math. Program..

[8]  Christos Koufogiannakis,et al.  Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost , 2009, ICALP.

[9]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[10]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[11]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[12]  L. Wolsey,et al.  On the greedy heuristic for continuous covering and packing problems , 1982 .