Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs-Reference-Cited by-同舟云学术

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs

Published: Issue: Volume: Page:52-63
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Athanassopoulos Stavros,Caragiannis Ioannis,Kaklamanis Christos

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74240-1_6.pdf

Reference15 articles.

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 1997), 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 1995), pp. 160–169 (1995)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Approximation Bound for Spanning Star Forest and Color Saving;Mathematical Foundations of Computer Science 2009;2009

2. A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem;Lecture Notes in Computer Science

3. Covering the Edges of Bipartite Graphs Using K 2,2 Graphs;Approximation and Online Algorithms