Algorithms for approximate graph coloring

Authors:
Avrim Louis Blum;Ronald L. Rivest
Affiliations:
-;-
Venue:
Algorithms for approximate graph coloring
Year:
1991

Citing 0
Cited 3

On the approximability of clique and related maximization problems

Journal of Computer and System Sciences
Buying cheap is expensive: hardness of non-parametric multi-product pricing

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract