Journal of the ACM Bibliography

Selected papers that cite this one

• N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh. Approximate Hypergraph Coloring Nordic Journal of Computing, 3(4):425-439, Winter 1996.

• Avrim Blum. New approximation algorithms for graph coloring. Journal of the ACM, 41(3):470-516, May 1994.

• Avrim Blum and David Karger. An \tilde{O}(n^{3/14})-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1):49-53, 14 January 1997.

• Avrim Blum and Joel Spencer. Coloring random and semi-random k-colorable graphs. Journal of Algorithms, 19(2):204-234, September 1995.

• L. J. Cowen, W. Goddard, and C. E. Jesurum. Coloring with defect. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 548-557, New Orleans, Louisiana, 5-7 January 1997.

• Uriel Feige. Randomized graph products, chromatic numbers, and the Lovasz theta-function (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 635-640, Las Vegas, Nevada, 29 May-1 June 1995.

• 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.

• Magnús M. Halldórsson. Parallel and on-line graph coloring. Journal of Algorithms, 23(2):265-280, May 1997.

• David Karger, Rajeev Motwani, and Madhu Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45(2):246-265, March 1998.

• Michael Krivelevich. Approximate set covering in uniform hypergraphs. Journal of Algorithms, 25(1):118-143, October 1997.

• M. Luby. Introduction to special issue on randomized and derandomized algorithms. Algorithmica, 16(4/5):359-366, October/November 1996.

• Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981, September 1994.

Shortcuts: