Algorithms for approximate graph coloring

Authors:
Avrim Louis Blum
Affiliations:
Massachusetts Institute of Technology, Cambridge
Venue:
Algorithms for approximate graph coloring
Year:
1992

Citing 0
Cited 4

New approximation algorithms for graph coloring

Journal of the ACM (JACM)
Randomized graph products, chromatic numbers, and Lovasz j-function

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The value of strong inapproximability results for clique

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Polynomial approximation and graph-coloring

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract