Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICALP

2005

Springer

2005

Springer

Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to ﬁnd a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize k i=1 maxv∈Ci w(v). The problem arises in scheduling conﬂicting jobs in batches and in minimizing buﬀer size in dedicated memory managers. In this paper we present three approximation algorithms and one inapproximability result for the max-coloring problem. We show that if for a class of graphs G, the classical problem of ﬁnding a proper vertex coloring with fewest colors has a c-approximation, then for that class G of graphs, max-coloring has a 4c-approximation algorithm. As a consequence, we obtain a 4-approximation algorithm to solve max-coloring on perfect graphs, and well-known subclasses such as chordal graphs, and permutation graphs. We also obtain constant-factor algorithms for maxcoloring on classes of graphs such as circle graphs, circular arc graphs, and unit disk graphs, whic...

Related Content

Added |
27 Jun 2010 |

Updated |
27 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
ICALP |

Authors |
Sriram V. Pemmaraju, Rajiv Raman |

Comments (0)