Journal of the ACM Bibliography
M.
R. Garey and D. S.
Johnson. The complexity of near-optimal graph coloring.
Journal of the ACM, 23(1):43-49, January 1976.
[BibTeX entry]
Selected papers that cite this one
- Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and
Mario Szegedy. Interactive proofs and the
hardness of approximating cliques. Journal of the ACM,
43(2):268-292, March 1996.
- Richard J. Lipton. On proving that a graph has
no large clique: A connection with Ramsey theory. Information
Processing Letters, 58(1):39-42, 8 April 1996.
- Carsten Lund and Mihalis Yannakakis. On the hardness of approximating
minimization problems. Journal of the ACM,
41(5):960-981, September 1994.
- Leonard Pitt and Manfred K. Warmuth. The minimum consistent DFA problem
cannot be approximated within any polynomial. Journal of the
ACM, 40(1):95-142, January 1993.
Shortcuts: