Lower Bound for (Sum) Coloring Problem - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2019

Lower Bound for (Sum) Coloring Problem

Résumé

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 problem, based on a relaxation into an integer partition problem with additional constraints. We improve the lower bound for 18 graphs of standard benchmark DIMACS, and prove the optimal value for 4 graphs by reaching their known upper bound.
Fichier principal
Vignette du fichier
lowerBoundSCP_hal.pdf (632.12 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02291389 , version 1 (19-09-2019)

Identifiants

Citer

Alexandre Gondran, Vincent Duchamp, Laurent Moalic. Lower Bound for (Sum) Coloring Problem. 2019. ⟨hal-02291389⟩
93 Consultations
147 Téléchargements

Altmetric

Partager

More