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

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

Volumn 4368 LNCS, Issue , 2007, Pages 290-301

  Levin, Asaf ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HARMONIC ANALYSIS; ONLINE SEARCHING; PROBLEM SOLVING; SET THEORY;

HARMONIC NUMBERS; K-SET COVER PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 38149004844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11970125_23     Document Type: Conference Paper

References (19)

1. R. Bar-Yehuda and S. Even, "A linear time approximation algorithm for the weighted vertex cover problem," Journal of Algorithms, 2, 198-203, 1981.
2. V. Chvátal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, 4, 233-235, 1979.
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," Proc. STOC 1997, 256-264, 1997.
5. U. Feige, "A threshold of in n for approximating set cover", Journal of the ACM, 45, 634-652, 1998.
6. T. Fujito and T. Okumura, "A modified greedy algorithm for the set cover problem with weights 1 and 2," Proc. ISAAC 2001, 670-681, 2001.
7. O. Goldschmidt, D. S. Hochbaum and G. Yu, "A modified greedy heuristic for the set covering problem with improved worst case bound," Information Processing Letters, 48, 305-310, 1993.
8. M. M. Halldórsson, "Approximating k set cover and complementary graph coloring," Proc. IPCO 1996, 118-131, 1996.
9. R. Hassin and A. Levin, " A better-than-greedy approximation algorithm for the minimum set cover problem," SIAM J. Computing, 35, 189-200, 2006.
10. D. S. Hochbaum, "Approximation algorithms for the weighted set covering and node cover problems," SIAM Journal on Computing, 11, 555-556, 1982.
11. 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 Journal on Discrete Mathematics, 2, 68-72, 1989.
12. D. S. Johnson, "Approximation algorithms for combinatorial problems," Journal of Computer and System Sciences, 9, 256-278, 1974.
13. R. M. Karp, "Reducibility among combinatorial problems," Complexity of computer computations (R.E. Miller and J.W. Thatcher, eds.), Plenum Press, New-York, 1972, 85-103.
14. S. Khanna, R. Motwani, M. Sudan and U. V. Vazirani, "On syntactic versus computational views of approximability," SIAM Journal on Computing, 28, 164-191, 1998.
15. L. Lovász, "On the ratio of optimal integral and fractional covers," Discrete Mathematics, 13, 383-390, 1975.
16. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation and complexity classes," Journal of Computer System Sciences, 43, 425-440, 1991.
17. V. T. Paschos, "A survey of approximately optimal solutions to some covering and packing problems," ACM Computing Surveys, 29, 171-209, 1997.
18. R. Raz and S. Safra, "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP", Proc. STOC 1997, 475-484, 1997.
19. P. Slavík, "A tight analysis of the greedy algorithm for set cover," Journal of Algorithms, 25, 237-254, 1997.