Thumbnail
Access Restriction
Subscribed

Author Blum, Avrim
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Approximation algorithms ♦ Chromatic number ♦ Graph coloring
Abstract The problem of coloring a graph with the minimum number of colorsis well known to be NP-hard, even restricted to<?Pub Fmt italic>k<?Pub Fmt /italic>-colorable graphs for constant<?Pub Fmt italic>k<?Pub Fmt /italic> ≥ 3. This paper explores theapproximation problem of coloring<?Pub Fmt italic>k<?Pub Fmt /italic>-colorable graphs with as fewadditional colors as possible in polynomial time, with special focus onthe case of <?Pub Fmt italic>k<?Pub Fmt /italic> = 3.The previous best upper bound on the number of colors needed forcoloring 3-colorable <?Pub Fmt italic>n<?Pub Fmt /italic>-vertex graphsin polynomial time was o<fen lp="par">n/logn<rp post="par"> 3 as well.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-05-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 3
Page Count 47
Starting Page 470
Ending Page 516


Open content in new tab

   Open content in new tab
Source: ACM Digital Library