Improved Approximation Guarantees for Packing and Covering Integer Programs

Several important NP-hard combinatorial optimization problems can be posed as packing/covering integer programs; the randomized rounding technique of Raghavan and Thompson is a powerful tool with which to approximate them well. We present one elementary unifying property of all these integer linear programs and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This yields a pessimistic estimator, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees that are significantly better than those known.

[1]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[3]  J. D. Esary,et al.  Coherent Structures of Non-Identical Components , 1963 .

[4]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[5]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

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

[8]  P. Erdös.  On an extremal problem in graph theory , 1970 .

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

[10]  David Aldous.  The harmonic mean formula for probabilities of unions: applications to sparse random graphs , 1989, Discret. Math..

[11]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[12]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[13]  Aravind Srinivasan,et al.  An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.

[14]  Dorit S. Hochbaum,et al.  Heuristics for the fixed cost median problem , 1982, Math. Program..

[15]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[16]  R. Vohra,et al.  Linear programming relaxations, approximation algorithms and randomization: A unified view of covering problems , 1994 .

[17]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[18]  Prabhakar Raghavan.  Randomized Approximation Algorithms in Combinatorial Optimization , 1994, FSTTCS.

[19]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[20]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[21]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[22]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[23]  David J. Hunter.  An upper bound for the probability of a union , 1976, Journal of Applied Probability.

[24]  Petr Slavík,et al.  A tight analysis of the greedy algorithm for set cover , 1996, STOC '96.

[25]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[26]  Paul Erdös,et al.  Optima of dual integer linear programs , 1988, Comb..

[27]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[28]  Moni Naor,et al.  Optimal File Sharing in Distributed Networks , 1995, SIAM J. Comput..

[29]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[31]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[32]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[33]  M. Bellare,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.