Approximating the unweighted k-set cover problem: Greedy meets local search

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 1, 2008, Pages 251-264

  Levin, Asaf ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximation algorithms; Set cover

Indexed keywords

APPROXIMATION RATIOS; BEST APPROXIMATIONS; FUNDAMENTAL PROBLEM; GREEDY ALGORITHMS; HARMONIC NUMBER; K-SET COVER PROBLEM; LOCAL SEARCH; RESEARCH EFFORTS; SET COVER; SET COVER PROBLEM;

SOLS;

APPROXIMATION ALGORITHMS;

EID: 70349353352     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060655225     Document Type: Article

References (21)

1. S. Athanassopoulos, I. Caragiannis, and C. Kaklamanis, Analysis of approximation algorithms for k-set cover using factor-revealing linear programs, in Proceedings of FCT 2007, Budapest, Hungary, 2007, pp. 52-63.
2. R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms, 2 (1981), pp. 198-203.
3. V. Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
4. P. Crescenzi and V. Kann, A Compendium of NP Optimization Problems, http://www.nada.kth.se/theory/problemlist.html
5. R. Duh and M. Fürer, Approximation of k-set cover by semi local optimization, in Proceedings of the 29th Annual ACM STOC 1997, El Paso, TX, 1997, pp. 256-264.
6. U. Feige, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652. (Pubitemid 128488790)
7. T. Fujito and T. Okumura, A modified greedy algorithm for the set cover problem with weights 1 and 2, in Proceedings of ISAAC 2001, Christchurch, New Zealand, 2001, pp. 670-681.
8. O. Goldschmidt, D. S. Hochbaum, and G. Yu, A modified greedy heuristic for the set covering problem with improved worst case bound, Inform. Process. Lett., 48 (1993), pp. 305-310.
9. M. M. Halldórsson, Approximating k set cover and complementary graph coloring, in Proceedings of IPCO 1996, Vancouver, BC, 1996, pp. 118-131.
10. R. Hassin and A. Levin, A better-than-greedy approximation algorithm for the minimum set cover problem, SIAM J. Comput., 35 (2005), pp. 189-200.
11. D. S. Hochbaum, Approximation algorithms for the set covering and vertex cover problems, SIAM J. Comput., 11 (1982), pp. 555-556.
12. C. A. J. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math., 2 (1989), pp. 68-72.
13. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
14. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
15. S. Khanna, R. Motwani, M. Sudan, and U. V. Vazirani, On syntactic versus computational views of approximability, SIAM J. Comput., 28 (1998), pp. 164-191. (Pubitemid 128491795)
16. A. Levin, Approximating the unweighted k-set cover problem: Greedy meets local search, in Proceedings of WAOA 2006, Zurich, 2006, pp. 290-301.
17. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
18. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
19. V. T. Paschos, A survey of approximately optimal solutions to some covering and packing problems, ACM Comput. Surveys, 29 (1997), pp. 171-209.
20. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and sub-constant errorprobability PCP characterization of NP, in Proceedings of the 29th Annual ACM STOC 1997, El Paso, TX, 1997, pp. 475-484.
21. P. Slavík, A tight analysis of the greedy algorithm for set cover, J. Algorithms, 25 (1997), pp. 237-254. (Pubitemid 127451763)