On the Hardness of 4-Coloring a 3-Colorable Graph
暂无分享,去创建一个
[1] Nathan Linial,et al. On the Hardness of Approximating the Chromatic Number , 2000, Comb..
[2] A. Blum. ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .
[3] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[7] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .
[8] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[9] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.
[10] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[11] Avrim Blum,et al. New approximation algorithms for graph coloring , 1994, JACM.
[12] David R. Karger,et al. An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.
[13] Venkatesan Guruswami,et al. Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..
[14] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[15] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[16] Ronald V. Book,et al. Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .
[17] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[18] Martin Fiirer. Improved Hardness Results for Approximating the Chromatic Number , 1995 .
[19] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[20] Martin Fürer. Improved Hardness Results for Approximating the Chromatic Number , 1995, FOCS.
[21] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[22] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[23] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[24] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[25] Magnús M. Halldórsson,et al. A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.
[26] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[27] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .