Approximation algorithms for partial covering problems extended abstract

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

Volumn 2076 LNCS, Issue , 2001, Pages 225-236

  Gandhi, Rajiv ^a   Khuller, Samir ^a   Srinivasan, Aravind ^b  

^a University of Maryland ^*  (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Primal dual methods; Prtial covering; Randomized rounding; St cover; Vertex cover

Indexed keywords

AUTOMATA THEORY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; ALGORITHMS; COMPUTATIONAL LINGUISTICS;

PRIMAL-DUAL METHODS; PRTIAL COVERING; RANDOMIZED ROUNDING; ST COVER; VERTEX COVER; PARTIAL COVERING; SET COVER;

APPROXIMATION ALGORITHMS;

EID: 84879523101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_19     Document Type: Conference Paper

References (30)

1. N. Alon, R. Boppana and J. H. Spencer. An asymptotic isoperimetric inequality. Geometric and Functional Analysis, 8:411-436, 1998.
2. B. Baker. Approximation Algorithms for NP-Complete Problems on Planar Graphs. JACM, Vol 41 (1), (1994), pp. 153-190.
3. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. J. of Algorithms 2:198-203, 1981.
4. 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.
5. R. Bar-Yehuda. Using homogeneous weights for approximating the partial cover problem. In Proc. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 71-75, 1999.
6. N. Bshouty, and L. Burroughs. Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. The Proceedings of the Fifteenth Annual Symposium on the Theoretical Aspects of Computer Science 298-308, 1998.
7. M. Charikar, S. Khuller, D. Mount, and G. Narasimhan. Algorithms for Facility Location Problems with Outliers. In Proc. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 642-651, 2001.
8. V. Chv́atal. A greedy heuristic for the set-covering problem. Math. of Oper. Res. Vol. 4, 3, 233-235, 1979.
9. K. L. Clarkson. A modification of the greedy algorithm for the vertex cover. Information Processing Letters 16:23-25, 1983.
10. T. H. Cormen, C. E. Leiserson and R. L. Rivest, "Introduction to Algorithms", MIT Press, 1989.
11. R. Duh and M. Fürer. Approximating k-set cover by semi-local optimization. In Proc. 29th STOC, May 1997, pages 256-264.
12. R. Gandhi, S. Khuller and A. Srinivasan. Approximation algorithms for partial covering problems. Technical Report CS-TR-# 4234 (April 2001). Also available at: http://www. cs. umd. edu/users/samir/grant/icalp01. ps
13. O. Goldschmidt, D. Hochbaum, and G. Yu. A modified greedy heuristic for the set covering problem with improved worst case bound. Information Processing Letters 48(1993), 305-310.
14. M. X. Goemans and J. Kleinberg. The Lovasz theta function and a semidefinite programming relaxation of vertex cover. SIAM Journal on Discrete Mathematics, 11:196-204, 1998.
15. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995.
16. M. Halldorsson. Approximating k-set cover and complementary graph coloring. In Proc. Fifth Conference on Integer Programming and Combinatorial Optimization, June 1996, LNCS 1084, pages 118-131.
17. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In Proc. Eleventh ACM-SIAM Symposium on Discrete Algorithms, January 2000, pages 329-337.
18. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. W. P. 64-79-80, GSIA, Carnegie-Mellon University, April 1980. SIAM J. Comput. 11(3) 1982.
19. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6:243-254, 1983.
20. D. S. Hochbaum (editor). Approximation Algorithms for NP-hard problems. PWS Publishing Company, 1996.
21. D. S. Hochbaum. The t-vertex cover problem: Extending the half integrality framework with budget constraints. In Proc. First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 111-122, 1998.
22. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM, 32(1):130-136, 1985.
23. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci. , 9:256-278, 1974.
24. M. Kearns. The computational complexity of machine learning. M. I. T. Press, 1990.
25. S. Khuller, U. Vishkin, and N. Young. A Primal Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover. Journal of Algorithms, 17(2):280-289, 1994.
26. L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Math. 13:383-390, 1975.
27. G. L. Nemhauser and L. E. Trotter, Jr. Vertex packings: Structural properties and algorithms. Mathematical Programming 8:232-248, 1975.
28. E. Petrank. The hardness of approximation: Gap location. Computational Complexity 4:133-157, 1994.
29. P. Slavik. Improved performance of the greedy algorithm for partial cover. Information Processing Letters 64:251-254, 1997.
30. A. Srinivasan. New Approaches to Covering and Packing Problems. In Proc. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 567-576, 2001.