Analysis of approximation algorithms for k-set cover using factor-revealing linear programs

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

Volumn 4639 LNCS, Issue , 2007, Pages 52-63

  Athanassopoulos, Stavros ^a   Caragiannis, Ioannis ^a   Kaklamanis, Christos ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

GREEDY ALGORITHMS; K-SET COVER PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 38149094785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_6     Document Type: Conference Paper

References (15)

1. Chvátal, V.: A greedy hueristic for the set-covering problem. Mathematics of Operations Research 4, 233-235 (1979)
2. Duh, R., Fürer, M.: Approximation of k-set cover by semi local optimization. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC '97), pp. 256-264. ACM Press, New York (1997)
3. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
4. Goldschmidt, O., Hochbaum, D., Yu, G.: A modified greedy heuristic for the set covering problem with improved worst case bound. Information Processing Letters 48, 305-310 (1993)
5. Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the 6th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA '95), pp. 160-169 (1995)
6. Halldórsson, M.M.: Approximating k-set cover and complementary graph coloring. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 1084, pp. 118-131. Springer, Heidelberg (1996)
7. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity 15(1), 20-39 (2006)
8. 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 Journal on Discrete Mathematics 2(1), 68-72 (1989)
9. Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50(6), 795-824 (2003)
10. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256-278 (1974)
11. Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37, 27-35 (1991)
12. Levin, A.: Approximating the unweighted k-set cover problem: greedy meets local search. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 290-310. Springer, Heidelberg (2007)
13. Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383-390 (1975)
14. Slavík, P.: A tight analysis of the greedy algorithm for set cover. Journal of Algorithms 25, 237-254 (1997)
15. Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pp. 453-461. ACM Press, New York (2001)