Weighted Coloring: Further Complexity and Approximability Results

Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . . . , Sk) of the vertex set of G into stable sets and minimizing k i=1 w(Si) where the weight of S is defined as max{w(v) : v ∈ S}. In this paper, we continue the investigation of the complexity and the approximability of this problem by answering some of the questions raised by D. J. Guan and X. Zhu (”A Coloring Problem for Weighted Graphs”, Inf. Process. Lett. 61(2):77-81 1997).

• Type: Conference
• Year: 2005
• Where: ICTCS
• Authors: Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
• Keywords: Coloring Problem, ICTCS 2005, Vertex-weighted Graph, Weighted Version