A tight analysis of the greedy algorithm for set cover

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 435-441

  Slavík, Petr ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Approximation algorithms; Fractional set cover; Greedy algorithm; Partial set cover; Set cover

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; NUMERICAL ANALYSIS; PERFORMANCE; RANDOM PROCESSES; SET THEORY;

GREEDY ALGORITHMS; INTEGRALITY GAPS; NEW APPROACHES; PARTIAL SET COVER; PERFORMANCE RATIO; RANDOMIZED ROUNDING; SET COVER; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS; ALGORITHMS;

FRACTIONAL SET COVER; GREEDY ALGORITHMS; LOWER BOUND; PARTIAL SET COVER; PERFORMANCE RATIO; RANDOMIZED ROUNDING TECHNIQUE; SET COVER; UPPER BOUND;

EID: 0029723340     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237991     Document Type: Conference Paper

References (12)

1. V. Chvátal. A Greedy Heuristic for the Set-covering Problem. Mathematics of Operations Research 4(1979), pp. 233-235.
2. P. Crescenzi and V. Kann. A Compendium of NP Optimization Problems. Technical Report SI/RR-95/02, Department of Computer Science, University of Rome "La Sapienza", 1995.
3. U. Feige. A Threshold of In n for Approximating Set Cover. In Proc. ACM Symposium on Theory of Computing (1996).
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness W. H. Freeman, New York, NY (1979).
5. M. M. Halldórsson. Approximating Discrete Collections via Local Improvements. Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995).
6. M. M. Halldórsson. Approximating Set Cover via Local Improvements. JAIST Technical Report IS-RR-95-0002F, 1995.
7. D. S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences 9(1974), pp. 256-278.
8. R. M. Karp. Reducibility among Combinatorial Problems. In R. E. Miller and J. W. Thatcher, editors. Complexity of Computer Computations, 85-103, Plenum Press, New York, NY (1972).
9. L. Lovasz. On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13(1975), pp. 383-390.
10. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. Journal of the ACM 41(1994), pp. 960-982.
11. P. Slavik. Improved Performance of the Greedy Algorithm for Minimum Set Cover and Minimum Partial Cover. Technical Report 95-45, Department of Computer Science, SUNY at Buffalo, 1995.
12. A. Srinivasan. Improved Approximation of Packing and Covering Problems. In Proc. ACM Symposium on Theory of Computing (1995), pp. 268-276.