A threshold of ln n for approximating set cover

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 314-318

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILITY; SET THEORY; THEOREM PROVING;

GREEDY ALGORITHMS; HARDNESS OF APPROXIMATION; LOW ORDER; SET COVER; TIME ALGORITHMS;

COMPUTATION THEORY;

GREEDY ALGORITHM; HARMONIC FUNCTION;

EID: 0029703219     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237977     Document Type: Conference Paper

References (18)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. "Proof verification and hardness of approximation problems". 33rd FOCS, 14-23, 1992.
2. M. Bellare, S. Goldwasser, C. Lund, A. Russell. "Efficient probabilistically checkable proofs and applications to approximation". Proc. of 25th STOC, 1993, 294-304.
3. M. Ben-Oi, S. Goldwasser, J. Kilian, A. Wigderson. "Multi-prover interactive proofs: how to remove intractability assumptions". Proc. 20th STOC, 1988, 113-131.
4. V. Ghvatal. "A greedy heuristic for the set covering problem". Math. Oper. Res., 4, 1919, 233-235.
5. M. Dyei, A. Frieze. "A simple heuristic for the p-center problem". Oper. Res. Lett., 3, 1985, 285-288.
6. I. I. Feige, J. Kilian. "Impossibility results for recycling random bits in two prover proof systems". Proc. of 27th Animal ACM Symposium on the Theory of Computing, 457-468, 1995.
7. U. Feige, L. Lovasz. "Two prover one round proof systems: their power and their problems". Proc. 24th STOC, 1992, 733-744.
8. J. Hastad, S. Phillips, S. Safra. "A well characterized approximation problem". Proc. 2nd Israel Symp. on Theory of Computing and Systems, 261-265, 1993.
9. D. Hochbaum, D. Shmoys. "A best possible approximation algorithm for the k-center problem". Math. Oper. Res.. 10, 1985, 180-184.
10. W. Hsu, G. Nemhauser. "Easy and hard bottleneck location problems". Discrete Applied Math., 1, 1979, 209-216.
11. D. Johnson. "Approximation algorithms for combinatotairl problems" J. Clomput. System Sci. 9, 1974, 256-278.
12. L. Lovasz. "On the ratio of the optimal integral and fractional covers". Discrete Mathematics 13 (1975) 183-390
13. C. Lund, M. Yannakakis. "On the hardness of approximating minimization problems". JACM 41(5), 1994, 960-981
14. M. Naor, L. Schulman, A. Srinivasan. "Splitters and near-optimal derandomization". Proc. of 36th Annual Symposium of Foundations of Computer Science, 182-191, 1995.
15. G. Papadimitriou, M. Yannakakis. "Optimization, approximation, and complexity classes". JCSS, 43, 1991, 425-440.
16. R. Raz. "A parallel repetition theorem". Proc. of 27th Annual ACM Symposium on the Theory of Computing, 447-456, 1995.
17. P. Slavik. "A tight analysis of the greedy algorithm for set cover". Proc. of 28th Annual ACM Symposium on Theory of Computing, 1996.
18. A. Srinivasan. "Improved approximations of packing and covering problems". Proc. of 27th Annual ACM Symposium on the Theory of Computing, 268-276, 1995.