Approximation algorithms for covering/packing integer programs

Journal of Computer and System Sciences

Volumn 71, Issue 4, 2005, Pages 495-505

  Kolliopoulos, Stavros G ^a   Young, Neal E ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b University of California Riverside   (United States)

Author keywords

Approximation algorithms; Covering packing integer programs; Multiplicity constraints; Set cover

Indexed keywords

APPROXIMATION THEORY; INTEGER PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

APPROXIMATION ALGORITHMS; COVERING/PACKING INTEGER PROGRAMS; MULTIPLICITY CONSTRAINTS; SET COVER;

ALGORITHMS;

EID: 27344443041     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.05.002     Document Type: Article

References (26)

1. E. Balas Facets of the knapsack polytope Math. Programming 8 1975 146 164
2. R.D. Carr, L.K. Fleischer, V.J. Leung, and C.A. Phillips Strengthening integrality gaps for capacitated network design and covering problems Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms 2000
3. V. Chvátal A greedy heuristic for the set-covering problem Math. Oper. Res. 4 3 1979 233 235
4. G. Dobson Worst-case analysis of greedy heuristics for integer programming with non-negative data Math. Oper. Res. 7 4 1982 515 531
5. P. Erdos, and J.L. Selfridge On a combinatorial game J. Combin. Theory A 14 1973 298 301
6. M.L. Fisher, and L.A. Wolsey On the greedy heuristic for continuous covering and packing problems SIAM J. Algebraic Discrete Methods 3 1982 584 591
7. P. Hammer, E. Johnson, and U. Peled Facets of regular 0-1 polytopes Math. Programming 8 1975 179 206
8. D.S. Hochbaum Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems D.S. Hochbaum Approximation Algorithms for NP-hard Problems 1997 PWS 94 143
9. D.S. Johnson Approximation algorithms for combinatorial problems J. Comput. System Sci. 9 1974 256 278
10. S.G. Kolliopoulos Approximating covering integer programs with multiplicity constraints Discrete Appl. Math. 129 2003 461 473
11. S.G. Kolliopoulos, and N.E. Young Tight approximation results for general covering integer programs Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science 2001 522 528
12. L. Lovász On the ratio of optimal and fractional covers Discrete Math. 13 1975 383 390
13. L. Lovász An Algorithmic Theory of Numbers, Graphs and Complexity 1986 SIAM Philadelphia, PA
14. M. Naor, and R.M. Roth Optimal file sharing in distributed networks SIAM J. Comput. 24 1995 158 183
15. S. Plotkin, D.B. Shmoys, and É. Tardos Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 20 1995 257 301
16. P. Raghavan Probabilistic construction of deterministic algorithms: approximating packing integer programs J. Comput. System Sci. 37 1988 130 143
17. P. Raghavan, and C.D. Thompson Randomized rounding: a technique for provably good algorithms and algorithmic proofs Combinatorica 7 1987 365 374
18. S. Rajagopalan, and V.V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science 1993 322 331
19. R. Raz, and S. Safra A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP Proceedings of the 29th Annual ACM Symposium on Theory of Computing 1997 475 484
20. J. Spencer Ten Lectures on the Probabilistic Method 1987 SIAM Philadelphia
21. A. Srinivasan An extension of the Lovász local lemma and its applications to integer programming Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms 1996 6 15
22. A. Srinivasan Improved approximations guarantees for packing and covering integer programs SIAM J. Comput. 29 1999 648 670 (preliminary version in Proc. STOC 95)
23. A. Srinivasan, and C.-P. Teo A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria SIAM J. Comput. 30 2001 2051 2068 (preliminary version in Proc. STOC 97)
24. V.V. Vazirani Approximation Algorithms 2001 Springer Berlin
25. L. Wolsey Facets for a linear inequality in 0-1 variables Math. Programming 8 1975 168 175
26. N.E. Young Randomized rounding without solving the linear program Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms 1995 170 178