New Lower Bound for the Minimum Sum Coloring Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

New Lower Bound for the Minimum Sum Coloring Problem

(1) , (1) , (2, 1)
1
2

Résumé

The Minimum Sum Coloring Problem (MSCP) is an NP-Hard problem derived from the graph coloring problem (GCP) and has practical applications in different domains such as VLSI design, distributed resource allocation, and scheduling. There exist few exact solutions for MSCP, probably due to its search space much more elusive than that of GCP. On the contrary, much effort is spent in the literature to develop upper and lower bounds for MSCP. In this paper, we borrow a notion called motif, that was used in a recent work for upper bounding the minimum number of colors in an optimal solution of MSCP, to develop a new algebraic lower bound called LBM Sigma for MSCP. Experiments on standard benchmarks for MSCP and GCP show that LBM Sigma is substantially better than the existing lower bounds for several families of graphs.
Fichier non déposé

Dates et versions

hal-03636429 , version 1 (10-04-2022)

Identifiants

  • HAL Id : hal-03636429 , version 1

Citer

Clement Lecat, Corinne Lucet, Chu-Min Li. New Lower Bound for the Minimum Sum Coloring Problem. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, Feb 2017, San Francisco, United States. pp.853-859. ⟨hal-03636429⟩
31 Consultations
0 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More