A Threshold of ln n for Approximating Set Cover

Journal of the ACM

Volumn 45, Issue 4, 1998, Pages 634-652

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algorithms; Approximation ratio; F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems computations on discrete structures; Performance; Set cover; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY;

SET COVER; SUPERPOLYNOMIAL TIME ALGORITHMS;

COMPUTATIONAL METHODS;

EID: 0032108328     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/285055.285059     Document Type: Article

References (34)

1. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1992. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 14-23.
2. ARORA, S., AND SAFRA, S. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 1 (Jan.), 72-122.
3. BABAI, L., FORTNOW, L., AND LUND, C. 1991. Non-deterministic exponential time has two-prover interactive protocols. Computat. Complex. 1, 3-40.
4. BABAI, L., AND MORAN, S. 1988. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36, 254-276.
5. BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. 1993. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 294-304.
6. BEN-OR, M., GOLDWASSER, S., KILIAN, J., AND WIGDERSON, A. 1988. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 113-131.
7. CHVATAL, V. 1979. A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233-235.
8. DYER, M., AND FRIEZE, A. 1985. A simple heuristic for the p-cent problem. Oper. Res. Lett. 3, 285-288.
9. FEIGE, U., GOLDWASSER, S., LOVÁSZ, L., SAFRA, S., AND SZEGEDY, S. 1996. Interactive proofs and the hardness of approximating cliques. J. ACM 43, 2 (Mar.), 268-292.
10. FEIGE, U., AND KILIAN, J. 1995. Impossibility results for recycling random bits in two-prover proof systems. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 457-468.
11. FEIGE, U., AND KILIAN, J. 1996. Zero knowledge and the chromatic number. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., pp. 278-287.
12. FEIGE, U., AND LOVÁSZ, L. 1992. Two-prover one-round proof systems: Their power and their problems. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 733-744.
13. FORTNOW, L., ROMPEL, J., AND SIPSER, M. 1994. On the power of multi-prover interactive protocols. Theoret. Comput. Sci. 134, 545-557.
14. GOLDWASSER, S., MICALI, S., AND RACKOFF, S. 1989. The knowledge complexity of interactive proof-systems. SIAM J. Comput. 18, 186-208.
15. GUHA, S., AND KHULLER, S. 1998. Greedy strikes back: Improved facility location algorithms. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, to appear.
16. HALLDORSSON, M. 1993. Approximating the minimum maximal independence number. Inf. Proc. Lett. 46, 169-172.
17. 1-∈. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 627-636.
18. HASTAD, J. 1997. Some optimal inapproximability results. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 1-10.
19. HASTAD, J., PHILLIPS, S., AND SAFRA, S. 1993. A well-characterized approximating problem. In Proceedings of the 2nd Israel Symposium on Theory of Computing and Systems. IEEE Computing Society Press, Los Alamitos, Calif., pp. 261-265.
20. HOCHBAUM, D. (ED.). 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, Mass.
21. HOCHBAUM, D., AND SHMOYS, D. 1985. A best possible approximation algorithm for the k -center problem. Math. Oper. Res. 10, 180-184.
22. HSU, W., AND NEMHAUSER, G. 1979. Easy and hard bottleneck location problems. Disc. Appl. Math. 1, 209-216.
23. JOHNSON, D. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256-278.
24. LOVÁSZ, L. 1975. On the ratio of the optimal integral and fractional covers. Disc. Math. 13, 383-390.
25. LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. 1992. Algebraic methods for interactive proof systems. J. ACM 39, 4 (Oct.), 859-868.
26. LUND, C., AND YANNAKAKIS, M. 1994. On the hardness of approximating minimization problems. J. ACM 41, 5 (Sept.), 960-981.
27. NAOR, M., SCHULMAN, L., AND SRINIVASAN, A. 1995. Splitters and near-optimal derandomization. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 182-191.
28. PAPADIMITRIOUS, C., AND YANNAKAKIS, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425-440.
29. PAZ, A., AND MORAN, S. 1981. Nondeterministic polynomial optimization problems and their approximations. Theoret. Comput. Sci. 15, 251-277.
30. RAZ, R. 1995. A parallel repetition theorem. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 447-456.
31. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characteristization of NP. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 475-484.
32. SHAMIR, A. 1992. IP-PSPACE. J. ACM 39, 4 (Oct.), 869-877.
33. SLAVÍK, P. 1996. A tight analysis of the greedy algorithm for set cover. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 435-439.
34. SRINISAVAN, A. 1995. Improved approximations of packing and covering problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 268-276.