Author:
Chor Benny,Fellows Mike,Juedes David
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
2. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Information Processing Letters 45, 19–23 (1993)
3. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41, 960–981 (1994)
4. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability – towards tight results. SIAM Journal on Computing 27, 804–915 (1998)
5. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, pp. 278–289. IEEE Computer Society Press, Los Alamitos (1996)
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献