A modified greedy algorithm for the set cover problem with weights 1 and 2

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

Volumn 2223 LNCS, Issue , 2001, Pages 670-681

  Fujito, Toshihiro ^a   Okumura, Tsuyoshi ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; BASE SET; GREEDY ALGORITHMS; GREEDY HEURISTICS; K-SET COVER PROBLEM; MINIMUM WEIGHT; SET COVER; SET COVER PROBLEM; K-SET COVERS;

COMPUTATION THEORY; HEURISTIC METHODS; FLUORINE; SET THEORY; URANIUM;

SET THEORY; ALGORITHMS;

EID: 71049158843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_57     Document Type: Conference Paper

References (19)

1. Arkin, E. M., Hassin, R.: On local search for weighted k-set packing. In: Proc. ESA '97. LNCS #1284. Springer-Verlag (1997) 13-22 671
2. Bafna, V., Narayanan, B., Ravi, R.: Nonoverlapping local alignments (Weighted independent sets of axis-parallel rectangles). Discrete Appl. Math. 71 (1996) 41-53 671
3. Chandra, B., Halldorsson, M. M.: Greedy local improvement and weighted set packing approximation. In: Proc. 10th Annual ACM-SIAM Symp. Discrete Algorithms. ACM-SIAM (1999) 169-176 671
4. Chvátal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3) (1979) 233-235 671, 673
5. Duh, R., Fürer, M.: Approximation of k-set cover by semi-local optimization. In: Proc. 29th Annual ACM Symp. Theory of Computing. ACM (1997) 256-264 671
6. Edmonds, J.: Paths, trees and flowers. Canad. J. Math. 17 (1965) 449-467 672, 673
7. Feige, U.: A threshold of lnn for approximating set cover. In: Proc. 28th Annual ACM Symp. Theory of Computing. ACM (1996) 314-318 671
8. Gallai, T.: Kritische Graphen II. Magyar Tud. Akad. Mat. Kutato Int. Közl. 8 (1963) 373-395 672, 673
9. Gallai, T.: Maximale Systeme unabhangiger Kanten. Magyar Tud. Akad. Mat. Kutato Int. Közl. 9 (1964) 401-413 672, 673
10. Goldschmidt, O., Hochbaum, D. S., Yu, G.: A modified greedy heuristic for the Set Covering problem with improved worst case bound. Inform. Process. Lett. 48 (1993) 305-310 671, 673
11. Halldórsson, M. M.: Approximating discrete collections via local improvements. In: Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms. ACM-SIAM (1995) 160-169 671
12. Halldórsson, M. M.: Approximating k-set cover and complementary graph coloring. In: Proc. IPCO V. LNCS #1084. Springer-Verlag (1996) 118-131 671
13. Hurkens, C. A. J., Schrijver, A.: 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(1) (1989) 68-72 671
14. Johnson, D. S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256-278 670
15. Karp, R. M.: Reducibility among combinatorial problems. In: Miller, R. E., Thatcher, J. W. (eds.): Complexity of Computer Computations. Plenum Press, New York (1972) 85-103 670
16. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13 (1975) 383-390 670
17. Micali, S. and Vazirani, V. V.: An O(√ V| · |E|) algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual Symp. Foundations of Computer Science. IEEE (1980) 17-27 680
18. Papadimitriou, C., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci. 43 (1991) 425-440 670
19. Slavík, P.: A tight analysis of the greedy algorithm for set cover. In: Proc. 28th Annual ACM Symp. Theory of Computing. ACM (1996) 435-441 671