An improved approximation algorithm for vertex cover with hard capacities (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 164-175

  Gandhi, Rajiv ^a   Halperin, Eran ^b,d   Khuller, Samir ^a   Kortsarz, Guy ^c   Srinivasan, Aravind ^a  

^a Institute of Advanced Computer Science   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Capacitated covering; Linear programming; Randomized rounding; Set cover; Vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING;

BEST APPROXIMATIONS; CAPACITATED COVERING; LOWER ORDER TERMS; MINIMUM COVERS; RANDOMIZED ROUNDING; SET COVER; VERTEX COVER; VERTEX COVER PROBLEMS;

GRAPH THEORY;

EID: 35248813308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_15     Document Type: Article

References (19)

1. R. Bar-Yehuda and S. Even. A Local-Ratio Theorem for Approximating The Weighted Vertex Cover Problem. Annals of Discrete Mathematics, 25:27-45, 1985.
2. J. Bar-Ilan, G. Kortsarz and D. Peleg. Generalized submodular cover problems and applications. Theoretical Computer Science, 250, pages 179-200, 2001.
3. V. Chvátal. A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, vol. 4, No 3, pages 233-235, 1979.
4. R. D. Carr, L. K. Fleischer, V. J. Leung and C. A. Phillips. Strengthening Integrality Gaps For Capacitated Network Design and Covering Problems. In Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 106-115, 2000.
5. J. Chuzhoy and J. Naor. Covering Problems with Hard Capacities. Proc. of the Forty-Third IEEE Symp. on Foundations of Computer Science, 481-489, 2002.
6. G. Dobson. Worst Case Analysis of Greedy Heuristics For Integer Programming with Non-Negative Data. Math. of Operations Research, 7(4):515-531, 1980.
7. R. Gandhi, S. Khuller, S. Parthasarathy and A. Srinivasan. Dependent Rounding in Bipartite Graphs. In Proc. of the Forty-Third IEEE Symposium on Foundations of Computer Science, pages 323-332, 2002.
8. S. Guha, R. Hassin, S. Khuller and E. Or. Capacitated Vertex Covering with Applications. Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 858-865, 2002.
9. D. S. Johnson, Approximation algorithms for combinatorial problems. J. Computer and System Sciences, 9, pages 256-278, 1974.
10. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 329-337, 2000.
11. D. S. Hochbaum. Approximation Algorithms for the Set Covering and Vertex Cover Problems. SIAM Journal on Computing, 11:555-556, 1982.
12. D. S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22:148-162, 1982.
13. D. S. Hochbaum (editor). Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1996.
14. S. G. Kolliopoulos and N. E. Young. Tight Approximation Results for General Covering Integer Programs. In Proc. of the Forty-Second Annual Symposium on Foundations of Computer Science, pages 522-528, 2001.
15. L. Lovász, On the ratio of optimal integral and fractional covers. Discrete Math., 13, pages 383-390, 1975.
16. M. Pál, É. Tardos and T. Wexler. Facility Location with Nonuniform Hard Capacities. In Proc. Forty-Second Annual Symposium on Foundations of Computer Science, 329-338, 2001.
17. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.
18. L. A. Wolsey. An analysis of the greedy algorithm for the sub-modular set covering problem. Combinatorica, 2:385-393, 1982.
19. N. E. Young. K-medians, facility location, and the Chernoff-Wald bound. ACM-SIAM Symposium on Discrete Algorithms, pages 86-95, 2000.