Towards optimal lower bounds for clique and chromatic number

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 537-584

  Engebretsen, Lars ^a   Holmerin, Jonas ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

CHROMATIC NUMBERS;

GRAPH THEORY;

EID: 0037453397     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00535-2     Document Type: Article

References (25)

1. Alon N., Spencer J.H. The Probabilistic Method. 1991;Wiley, New York.
2. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and the hardness of approximation problems. J. ACM. 45(3):1998;501-555.
3. Arora S., Safra S. Probabilistic checking of proofs. a new characterization of NP J. ACM. 45(1):1998;70-122.
4. Bellare M., Goldreich O., Sudan M. Free bits, PCPs and non-approximability - towards tight results. SIAM J. Comput. 27(3):1998;804-915.
5. M. Bellare, M. Sudan, Improved non-approximability results, in: Proc. 26th Annu. ACM Symp. on the Theory of Computing, Montréal, Qué., Canada, 23-25 May 1994, pp. 184-193.
6. Boppana R., Halldórsson M.M. Approximating maximum independent sets by excluding subgraphs. Bit. 32(2):1992;180-196.
7. 1-o(1), in: U. Montanari, J.D.P. Rolim, E. Welzl (Eds.), Proc. 27th Internat. Colloq. on Automata, Languages and Programming, Geneva, 9-15 July 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, pp. 2-12.
8. Feige U. Randomized graph products, chromatic numbers, and the Lovász. ν-function Combinatorica. 17(1):1997;79-90.
9. Feige U. A threshold of. ln n for approximating set cover J. ACM. 45(4):1998;634-652.
10. Feige U., Goldwasser S., Lovász L., Safra S., Szegedy M. Interactive proofs and the hardness of approximating cliques. J. ACM. 43(2):1996;268-292.
11. Feige U., Kilian J. Zero knowledge and the chromatic number. J. Comput. System Sci. 57(2):1998;187-199.
12. M. Fürer, Improved hardness results for approximating the chromatic number, in: 36th Annu. Symp. on Foundations of Computer Science, Milwaukee, WI, 23-25 October 1995, IEEE, New York, pp. 414-421.
13. Halldórsson M.M. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45(1):1993;19-23.
14. 1-ε Acta Math. 182(1):1999;105-142.
15. Håstad J. Some optimal inapproximability results. J. ACM. 48(4):2001;798-859.
16. J. Håstad, S. Khot, Query efficient PCPs with perfect completeness, in: 42nd Annu. Symp. on Foundations of Computer Science, Las Vegas, NV, 14-17 November 2001, IEEE, New York, pp. 610-619.
17. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
18. S. Khanna, N. Linial, S. Safra, On the hardness of approximating the chromatic number, in: Proc. 2nd Israel Symp. on Theory of Computing and Systems, Natanya, Israel, 7-9 June 1993, IEEE Computer Society, Silverspring, MD, pp. 250-260.
19. S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in: 42nd Annu. Symp. on Foundations of Computer Science, Las Vegas, NV, 14-17 November 2001, IEEE, New York, pp. 600-609.
20. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13(4):1975;383-390.
21. Lund C., Yannakakis M. On the hardness of approximating minimization problems. J. ACM. 41(5):1994;960-981.
22. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge.
23. Raz R. A parallel repetition theorem. SIAM J. Comput. 27(3):1998;763-803.
24. A. Samorodnitsky, L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in: Proc. 32nd Annu. ACM Symp. on Theory of Computing, Portland, OR, 21-23 May 2000, pp. 191-199.
25. Zuckerman D. On unapproximable versions of NP-complete problems. SIAM J. Comput. 25(6):1996;1293-1304.