Clément Lecat

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Minimum Sum Coloring Problem (MSCP ) is derived from the Graph Coloring Problem (GCP ) by associating a weight to each color. The aim ofMSCP is to find a coloring solution of a graph such that the sum of color weights is minimum.MSCP has important applications in fields such as scheduling and VLSI design. We propose in this paper new upper bounds of the(More)
  • 1