Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion

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

Volumn 4051 LNCS, Issue , 2006, Pages 226-237

  Khot, Subhash ^a   Ponnuswami, Ashok Kumar ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; LINEAR EQUATIONS; POLYNOMIALS;

CHROMATIC NUMBER; INAPPROXIMABILITY; POLYNOMIAL TIME ALGORITHM;

COMPUTER PROGRAMMING;

EID: 33746347703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_21     Document Type: Conference Paper

References (28)

1. S. Arora, Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. thesis, UC Berkeley, 1994.
2. S. Arora, C. Lund, R. Motawani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
3. S. Arora and S. Safra. Probabilistic checking of proofs : A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability. Electronic Colloquium on Computational Complexity, Technical Report TR95-024, 1995.
5. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistic checkable proofs and applications to approximation. In Proc. 25th ACM Symposium on Theory of Computing, pages 294-304, 1993.
6. M. Bellare and M. Sudan. Improved non-approximability results. In Proc. 26th ACM Symposium on Theory of Computing, pages 184-193, 1994.
7. Avrim Louis Blum. Algorithms for approximate graph coloring. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 1992.
8. I. Dumer, D. Micciancio, and M. Sudan. Hardness of approximating the minimum distance of a linear code. In Proc, 40th IEEE Symposium on Foundations of Computer Science, 1999.
9. L. Engebretsen and J. Holmerin, Towards optimal lower bounds for clique and chromatic number. Electronic Colloquium on Computational Complexity (ECCC), (TR01-003), 2001.
10. U. Feige. Randomized graph products, chromatic numbers, and the lovász θfunction. In Proc. 27th ACM Symposium on Theory of Computing, pages 635-640, 1995.
11. U. Feige. Approximating maximum clique by removing subgraphs. SIAM J. Discrete Math., 18(2):219-225, 2004.
12. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996.
13. U. Feige and J. Kilian. Two prover protocols: low error at affordable rates. In Proc. 26th ACM Symposium on Theory of Computing, pages 172-183, 1994.
14. U. Feige and J. Kilian. Zero knowledge and the chromatic number. In Proc. 11th IEEE Conference on Computational Complexity, pages 278-287, 1996.
15. Uriel Feige and Shimon Kogan. Hardness of approximation of the balanced complete bipartite subgraph problem. Technical Report MCS04-04, The Weizmann Institute of Science, 2004.
16. J. Hastad. Clique is hard to approximate within n1-ε. In Proc. 37th IEEE Symposium on Foundations of Computer Science, pages 627-636, 1996.
17. J. Håstad. Testing of the long code and hardness for clique. In Proc. 28th ACM Symposium on Theory of Computing, pages 11-19, 1996.
18. J. Hastad. Some optimal inapproximability results. In Proc. 29th ACM Symposium on Theory of Computing, pages 1-10, 1997.
19. J. Hastad and A. Wigderson. Simple analysis of graph tests for linearity and PCP. In Proc. 16th IEEE Conference on Computational Complexity, 2001.
20. S. Khot. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science, 2001.
21. Subhash Khot. On the power of unique 2-prover 1-round games. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 767-775, New York, NY, USA, 2002. ACM Press.
22. Donald E. Knuth. The sandwich theorem. Electr. J. Comb., 1, 1994.
23. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
24. A. Samorodnitsky and L. Treviaan. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd ACM Symposium on Theory of Computing, pages 191-199, 2000.
25. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and peps. Electronic Colloquium on Computational Complexity (ECCC), (TR05-116), 2005.
26. Aravind Srinivasan. The value of strong inapproximability resulta for clique. In STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 144-152, 2000.
27. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proc. 33rd ACM Symposium on Theory of Computing, pages 453-461, 2001.
28. D. Zuckerman. On unapproximable versions of NP-complete problems. SIAM J. on Computing, pages 1293-1304, 1996.