Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

New Lower Bound for the Minimum Sum Coloring Problem

Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées
Contributeur : Louise DESSAIVRE Connectez-vous pour contacter le contributeur
Soumis le : dimanche 10 avril 2022 - 11:39:24
Dernière modification le : dimanche 21 août 2022 - 13:38:25


  • HAL Id : hal-03636429, version 1


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⟩



Consultations de la notice