In this paper, we study the optimum cost chromatic partition (OCCP) problem for several graph classes. The OCCP problem is the problem of coloring the vertices of a graph such that adjacent vertices get different colors and that the total coloring costs are minimum. We prove that there exists no polynomial approximation algorithm with ratio O(|V|0.5-є) for the OCCP problem restricted to bipartite and interval graphs, unless P = N P. Furthermore, we propose approximation algorithms with ratio O(|V|0.5) for bipartite, interval and unimodular graphs. Finally, we prove that there exists no polynomial approximation algorithm with ratio O(|V|1-є) for the OCCP problem restricted to split, chordal, permutation and comparability graphs, unless P = NP.
CITATION STYLE
Jansen, K. (1997). Approximation results for the optimum cost chromatic partition problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 727–737). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_226
Mendeley helps you to discover research relevant for your work.