Clique is hard to approximate within n1−o(1)

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

Volumn 1853, Issue , 2000, Pages 2-12

  Engebretsen, Lars ^a   Holmerin, Jonas ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

MAX CLIQUE; POLYNOMIAL-TIME;

ROBOTS;

EID: 84974559956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_2     Document Type: Conference Paper

References (12)

1. S. Arora, C. Lund, R. Motwani, M. Sudhan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, May 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, Jan. 1998.
3. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and nonapproximability – towards tight results. SIAM J. Comput., 27(3):804-915, June 1998.
4. M. Bellare and M. Sudan. Improved non-approximability results. In Proc. Twenty sixth Ann. ACM Symp. on Theory of Comp., pages 184-193, Montréal, Québec, May 1994. ACM Press.
5. R. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. Bit, 32(2):180-196, June 1992.
6. U. Feige. Randomized graph products, chromatic numbers, and the Lovasz ϑ- function. In Proc. Twenty-seventh Ann. ACM Symp. on Theory of Comp., pages 635-640, Las Vegas, Nevada, May 1995. ACM Press.
7. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, July 1998.
8. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. J. ACM, 43(2):268-292, Mar. 1996.
9. 1−ϵ. In Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 627-636, Burlington, Vermont, Oct. 1996. IEEE Computer Society.
10. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
11. A. Samorodnitsky and L. Trevisan. Notes on a PCP characterization of NP with optimal amortized query complexity. Manuscript, May 1999.
12. D. Zuckerman. On unapproximable versions of NP-complete problems. SIAM J. Comput., 25(6):1293-1304, Dec. 1996.