Lower Bound for (Sum) Coloring Problem

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02291389
Contributor : Alexandre Gondran <>
Submitted on : Thursday, September 19, 2019 - 12:08:37 PM
Last modification on : Friday, September 20, 2019 - 1:18:21 AM

Files

lowerBoundSCP_hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02291389, version 1
  • ARXIV : 1909.08906

Collections

Citation

Alexandre Gondran, Vincent Duchamp, Laurent Moalic. Lower Bound for (Sum) Coloring Problem. 2019. ⟨hal-02291389⟩

Share

Metrics

Record views

50

Files downloads

26