On the hardness of approximating the chromatic number

Combinatorica

Volumn 20, Issue 3, 2000, Pages 393-415

  Khanna, Sanjeev ^a   Linial, Nathan ^c   Safra, Shmuel ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039550370     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070013     Document Type: Article

References (27)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, and M. SZEGEDY: Proof verification and hardness of approximation problems, Journal of the ACM, 45 (3) (1998), 501-555. Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, 1992.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, and M. SZEGEDY: Proof verification and hardness of approximation problems, Journal of the ACM, 45 (3) (1998), 501-555. Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, 1992.
3. S. ARORA and S. SAFRA: Probabilistic checking of proofs: A new characterization of NP, Journal of the ACM, 45 (1) (1998), 70-122. Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, 1992.
4. S. ARORA and S. SAFRA: Probabilistic checking of proofs: A new characterization of NP, Journal of the ACM, 45 (1) (1998), 70-122. Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, 1992.
5. 0.4) approximation algorithm for 3-coloring, Proceedings of the 21st ACM Symposium on the Theory of Computing, (1989), 535-542.
6. A. BLUM: Some tools for approximate 3-coloring, Proceedings of the 31st IEEE Symposium on Foundation of Computer Science, (1990), 554-562.
7. A. BLUM: Algorithms for Approximate Graph Coloring, Ph.D. thesis, Laboratory for Computer Science, MIT, Cambridge, MA, 1991.
8. A. BLUM: New approximation algorithms for graph coloring, Journal of the ACM, 41 (1994), 470-516.
9. 3/14)-coloring algorithm for 3-colorable graphs, Information Processing Letters, 61 (1) (1997), 49-53.
10. M. BELLARE and M. SUDAN: Improved non-approximability results, Proceedings of the 26th ACM Symposium on Theory of Computing, (1994), 184-193.
11. 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) (1996), 268-292. Preliminary version in Proceedings of the 32nd IEEE Sym. on Foundations of Computer Science, 1991.
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) (1996), 268-292. Preliminary version in Proceedings of the 32nd IEEE Sym. on Foundations of Computer Science, 1991.
13. U. FEIGE and J. KILIAN: Zero knowledge and the chromatic number, J. Comput. System Sci., 57 (2) (1998), 187-199. Preliminary version in Proceedings of the llth IEEE Conference on Computational Complexity, 1996.
14. U. FEIGE and J. KILIAN: Zero knowledge and the chromatic number, J. Comput. System Sci., 57 (2) (1998), 187-199. Preliminary version in Proceedings of the llth IEEE Conference on Computational Complexity, 1996.
15. M. FÜRER: Improved hardness results for approximating the chromatic number, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, (1995), 414-421.
16. M. R. GAREY and D. S. JOHNSON: The complexity of near-optimal graph coloring, Journal of the ACM, 23 (1976), 43-49.
17. M. R. GAREY and D. S. JOHNSON: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
18. V. GURUSWAMI and S. KHANNA: On the hardness of 4-coloring a 3-colorable graph, in preparation, 1999.
19. M. M. HALLDÓRSSON: A still better performance guarantee for approximate graph coloring, Inform. Process. Letters, 45 (1993), 19-23.
20. 1-∈, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, (1996), 627-636.
21. RICHARD M. KARP: Reducibility among combinatorial problems, in: Complexity of Computer Computations (eds.: Raymond E. Miller and James W. Thatcher), 85-103, Plenum Press, 1972.
22. D. R. KARGER, R. MOTWANI and M. SUDAN: Approximate graph coloring using semidefinite programming. Journal of the ACM, 45 (2) (1998), 246-265.
23. N. LINIAL and U. VAZIRANI: Graph products and chromatic numbers, Proc. 30th IEEE Sym. on Foundations of Computer Science, (1989), 124-128.
24. C. LUND and M. YANNAKAKIS: On the hardness of approximating minimization problems, Journal of the ACM, 41 (1994), 960-981. Preliminary version in Proceedings of the 25th ACM Symposium on Theory of Computing, 1993.
25. C. LUND and M. YANNAKAKIS: On the hardness of approximating minimization problems, Journal of the ACM, 41 (1994), 960-981. Preliminary version in Proceedings of the 25th ACM Symposium on Theory of Computing, 1993.
26. A. WIGDERSON: Improving the performance guarantee for approximate graph coloring, Journal of the ACM, 30 (4) (1983), 729-735. Preliminary version in Proceedings of the 14th ACM Symposium on Theory of Computing, 1982.
27. A. WIGDERSON: Improving the performance guarantee for approximate graph coloring, Journal of the ACM, 30 (4) (1983), 729-735. Preliminary version in Proceedings of the 14th ACM Symposium on Theory of Computing, 1982.