A better-than-greedy approximation algorithm for the minimum set cover problem

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 189-200

  Hassin, Refael ^a   Levin, Asaf ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximation algorithms; Greedy algorithm; Set cover problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; GREEDY ALGORITHM; SET COVER PROBLEM;

APPROXIMATION THEORY;

EID: 33644584619     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704444750     Document Type: Article

References (17)

1. R. BAR-YEHUDA AND S. EVEN, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms, 2 (1981), pp. 198-203.
2. V. CHVÁTAL, A greedy heuristic for the set-covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
3. P. CRESCENZI AND V. KANN, A compendium of NP optimization problems, http://www.nada. kth.se/theory/problemlist.html (1995).
4. R. DUH AND M. FÜRER, Approximation of k-set cover by semi local optimization, in Proceedings of the STOC, 1997, pp. 256-264.
5. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
6. T. FUJITO AND T. OKUMURA, A modified greedy algorithm for the set cover problem with weights 1 and 2, in Proceedings of the 12th International Symposium on Algorithms and Computation, 2001, pp. 670-681.
7. 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.
8. M. M. HALLDÓRSSON, Approximating k-set cover and complementary graph coloring, in Proceedings of the Integer Programming and Combinatorial Optimization Conference, 1996, pp. 118-131.
9. D. S. HOCHBAUM, Approximation algorithms for the weighted set covering and node cover problems, SIAM J. Comput., 11 (1982), pp. 555-556.
10. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
11. 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.
12. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability, SIAM J. Comput., 28 (1998), pp. 164-191.
13. L. LOVÀSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
14. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
15. V. T. PASCHOS, A survey of approximately optimal solutions to some covering and packing problems, ACM Comput. Surveys, 29 (1997), pp. 171-209.
16. 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 STOC, 1997, pp. 475-484.
17. P. SLAVÍK, A tight analysis of the greedy algorithm for set cover, J. Algorithms, 25 (1997), pp. 237-254.