Lower bounds for the minimum sum coloring problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Lower bounds for the minimum sum coloring problem

Résumé

In this paper we present our study of the minimum sum coloring problem (MSCP). We propose a general lower bound for MSCP based on extraction of specific partial graphs. Also, we propose a lower bound using some decomposition into cliques. The experimental results show that our approach improves the results for most literature instances.

Dates et versions

hal-00496293 , version 1 (30-06-2010)

Identifiants

Citer

Aziz Moukrim, Kaoutar Sghiouer, Corinne Lucet, Yu Li. Lower bounds for the minimum sum coloring problem. International symposium on combinatorial optimization, May 2010, Hammamet, Tunisia. pp.663-670, ⟨10.1016/j.endm.2010.05.084⟩. ⟨hal-00496293⟩
37 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More