On Approximating (Sparse) Covering Integer Programs
share
We consider approximation algorithms for covering integer programs of the form min 〈 c, x 〉 over x ∈N^n subject to A x ≥ b and x ≤ d; where A ∈R_≥ 0^m × n, b ∈R_≥ 0^m, and c, d ∈R_≥ 0^n all have nonnegative entries. We refer to this problem as CIP, and the special case without the multiplicity constraints x < d as CIP_∞. These problems generalize the well-studied Set Cover problem. We make two algorithmic contributions. First, we show that a simple algorithm based on randomized rounding with alteration improves or matches the best known approximation algorithms for CIP and CIP_∞ in a wide range of parameter settings, and these bounds are essentially optimal. As a byproduct of the simplicity of the alteration algorithm and analysis, we can derandomize the algorithm without any loss in the approximation guarantee or efficiency. Previous work by Chen, Harris and Srinivasan [12] which obtained near-tight bounds is based on a resampling-based randomized algorithm whose analysis is complex. Non-trivial approximation algorithms for CIP are based on solving the natural LP relaxation strengthened with knapsack cover (KC) inequalities [5,24,12]. Our second contribution is a fast (essentially near-linear time) approximation scheme for solving the strengthened LP with a factor of n speed up over the previous best running time [5]. Together, our contributions lead to near-optimal (deterministic) approximation bounds with near-linear running times for CIP and CIP_∞.
READ FULL TEXT
