1 paper
Alexandre Gondran, Vincent Duchamp, Laurent Moalic
The Minimum Sum Coloring Problem is a variant of the Graph Vertex Coloring Problem, for which each color has a weight. This paper presents a new way to find a lower bound of this p…