An improved approximation algorithm for vertex cover with hard capacities

Journal of Computer and System Sciences

Volumn 72, Issue 1, 2006, Pages 16-33

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

^a RUTGERS UNIVERSITY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d University of Maryland ^*  (United States)

^e UNIVERSITY OF MARYLAND   (United States)

Author keywords

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

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; APPROXIMATION FACTOR; VERTEX COVER PROBLEM;

ALGORITHMS;

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

References (19)

1. J. Bar-Ilan, G. Kortsarz, and D. Peleg Generalized submodular cover problems and applications Theoret. Comput. Sci. 250 2001 179 200
2. R. Bar-Yehuda, and S. Even A local-ratio theorem for approximating the weighted vertex cover problem Ann. Discrete Math. 25 1985 27 45
3. 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 106 115
4. J. Chuzhoy, and J. Naor Covering problems with hard capacities Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science 2002 481 489
5. V. Chvátal A greedy heuristic for the set covering problem Math. Oper. Res. 4 3 1979 233 235
6. G. Dobson Worst case analysis of greedy heuristics for integer programming with non-negative data Math. Oper. Res. 7 4 1980 515 531
7. U. Feige A Threshold of ln n for approximating set cover Proceedings of the 28th Annual ACM Symposium on Theory of Computing 1996 182 189
8. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan Dependent rounding in bipartite graphs Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science 2002 323 332
9. S. Guha, R. Hassin, S. Khuller, and E. Or Capacitated vertex covering with applications Proceedings of the ACM-SIAM Symposium on Discrete Algorithms 2002 858 865
10. E. Halperin Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms San Francisco, CA 2000 329 337
11. D.S. Hochbaum Approximation algorithms for the set covering and vertex cover problems SIAM J. Comput. 11 1982 555 556
12. D.S. Hochbaum Heuristics for the fixed cost median problem Math. Programming 22 1982 148 162
13. D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, MA, 1996.
14. D.S. Johnson Approximation algorithms for combinatorial problems J. Comput. System Sci. 9 1974 256 278
15. S.G. Kolliopoulos, and N.E. Young Tight approximation results for general covering integer programs Proceedings of the 42nd Annual Symposium on Foundations of Computer Science 2001 522 528
16. M. Pál, É. Tardos, and T. Wexler Facility location with nonuniform hard capacities Proceedings of the 42nd Annual Symposium on Foundations of Computer Science 2001 329 338
17. 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
18. L.A. Wolsey An analysis of the greedy algorithm for the submodular set covering problem Combinatorica 2 1982 385 393
19. N.E. Young, K-medians, facility location, and the Chernoff-Wald bound, ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 86-95.