Tight Approximation Results for General Covering Integer Programs

@inproceedings{Kolliopoulos2001TightAR,
  title={Tight Approximation Results for General Covering Integer Programs},
  author={Stavros G. Kolliopoulos and Neal E. Young},
  booktitle={FOCS},
  year={2001}
}
In this paper we study approximation algorithms for solving a generalcovering integer program.An n-vector x of nonnegative integers is sought, which minimizes T x; subject toAx b; x d: The entries of A; b; are nonnegative. Letm be the number of rows of A: Covering problems have been heavily studied in combinatorial optimization. We focus on the effect of the multiplicity constraints,x d; on approximability. Two longstanding open questions remain for this general formulation with upper bounds on… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

An extension of the Lovász Local Lemma and its applications to integer programming

A. Srinivasan
Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms , pages 6–15, • 1996
View 16 Excerpts
Highly Influenced

A Greedy Heuristic for the Set-Covering Problem

Math. Oper. Res. • 1979
View 8 Excerpts
Highly Influenced

On the ratio of optimal integral and fractional covers

Discrete Mathematics • 1975
View 8 Excerpts
Highly Influenced

Approximating covering integer pro grams with multiset constraints

S. G. Kolliopoulos
Submitted for journal pub lication, September • 2000
View 2 Excerpts

Approximating covering and packing problems: set cover, vertex cover, independent set, and rel ated problems

D. S. Hochbaum
D. S. Hochbaum, editor, Approximation Algorithms for NP-hard problems , pages 94–143. PWS, • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…