Title of article
Lower Bounds for the Minimal Sum Coloring Problem
Author/Authors
Moukrim، نويسنده , , A. and Sghiouer، نويسنده , , K. and Lucet، نويسنده , , C. and Li، نويسنده , , Y.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
663
To page
670
Abstract
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.
Keywords
Heuristics , minimum sum coloring , lower bounds
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455484
Link To Document