New approximation algorithms for graph coloring
type: Item
instance of: scholarly article
title: New approximation algorithms for graph coloring
zbMATH Open document ID: 0821.68092
DOI: 10.1145/176584.176586
published in: Journal of the ACM
publication date: 1995-09-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 08C15
zbMATH DE Number: 639181
zbMATH Keywords: chromatic number
zbMATH Keywords: graph coloring
author: Avrim Blum
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/176584.176586
OpenAlex ID: W2036660814
Wikidata QID: Q127770911
Recommended article: New approximation guarantee for chromatic number
Recommended article: Coloring 3-Colorable Graphs with Less than n 1/5 Colors
Recommended article: Approximate graph coloring by semidefinite programming
Recommended article: Algorithms for coloring semi-random graphs
description: scientific article; zbMATH DE number 639181