The Projection games conjecture and the NP-hardness of ln n-approximating set-cover

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

Volumn 7408 LNCS, Issue , 2012, Pages 276-287

  Moshkovitz, Dana ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ACCURACY; BIPARTITE GRAPHS; EXPONENTIAL TIME; HARDNESS OF APPROXIMATION; LOWER BOUNDS; NP-HARD; NP-HARDNESS; RESEARCH AGENDA; SET-COVER;

COMBINATORIAL OPTIMIZATION; HARDNESS;

APPROXIMATION ALGORITHMS;

EID: 84865296729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32512-0_24     Document Type: Conference Paper

References (22)

1. Arora, S., Lund, C., Motwani, R., Sudan,M., Szegedy,M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555 (1998)
2. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2, 153-177 (2006)
3. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
4. Arora, S., Sudan, M.: Improved low-degree testing and its applications. Combinatorica 23(3), 365-426 (2003)
5. Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximations. In: Proc. 25th ACM Symp. on Theory of Computing, pp. 294-304 (1993)
6. Charikar, M., Hajiaghayi, M., Karloff, H.: Improved Approximation Algorithms for Label Cover Problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 23-34. Springer, Heidelberg (2009)
7. Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233-235 (1979)
8. Cygan, M., Kowalik, L., Wykurz, M.: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16), 957-961 (2009)
9. Dinur, I., Fischer, E., Kindler, G., Raz, R., Safra, S.: PCP characterizations of NP: Toward a polynomially-small error-probability. Computational Complexity 20(3), 413-504 (2011)
10. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
11. 1-ε. Acta Mathematica 182, 105-142 (1999)
12. Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798-859 (2001)
13. Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science, pp. 600-609 (2001)
14. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symp. on Theory of Computing, pp. 767-775 (2002)
15. Khot, S.: Hardness of approximating the shortest vector problem in lattices. Journal of the ACM 52(5), 789-808 (2005)
16. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. In: Proc. 25th ACM Symp. on Theory of Computing (1993)
17. Moshkovitz, D., Raz, R.: Two query PCP with sub-constant error. Journal of the ACM 57(5) (2010)
18. Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 36th IEEE Symp. on Foundations of Computer Science, pp. 182-191 (1995)
19. Raz, R.: A parallel repetition theorem. SIAM Journal on Computing 27, 763-803 (1998)
20. Raz, R., Safra, S.: A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Symp. on Theory of Computing, pp. 475-484 (1997)
21. Slavi̇k, P.: A tight analysis of the greedy algorithm for set cover. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 435-441 (1996)
22. Srinivasan, A.: Improved approximations guarantees for packing and covering integer programs. SIAM Journal on Computing 29(2), 648-670 (1999)