Algorithmic complexity of list colorings
Discrete Applied Mathematics
A coloring problem for weighted graphs
Information Processing Letters
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs and Hypergraphs
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.00 |
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 ${\mathcal S}=(S_{1}...,S_{k})$of the vertex set V of G into stable sets and minimizing ∑i=1kw(Si) where the weight of S is defined as max{w(v) : v ∈ S}. In this paper, we keep on with the investigation of the complexity and the approximability of this problem by mainly answering one 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).