Sum Coloring : New upper bounds for the chromatic strength

TL;DR

This paper introduces new upper bounds for the chromatic strength in the Minimum Sum Coloring Problem, improving the efficiency of solving MSCP by reducing the search space through a novel motif-based abstraction.

Contribution

The paper presents a new motif-based approach to derive tighter upper bounds for the chromatic strength in MSCP, enhancing solution efficiency.

Findings

New bounds are significantly tighter than previous ones.

Bounds reduce the search space for MSCP solutions.

Experimental results confirm improved performance on benchmark graphs.

Abstract

The Minimum Sum Coloring Problem (MSCP) is derived from the Graph Coloring Problem (GCP) by associating a weight to each color. The aim of MSCP 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 chromatic strength, i.e. the minimum number of colors in an optimal solution of MSCP, based on an abstraction of all possible colorings of a graph called motif. Experimental results on standard benchmarks show that our new bounds are significantly tighter than the previous bounds in general, allowing to reduce substantially the search space when solving MSCP .