Skip to Main content Skip to Navigation
Conference papers

Greedy Algorithms for the Minimum Sum Coloring Problem

Abstract : In this paper we present our study of greedy algorithms for solving the minimum sum coloring problem (MSCP). We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the graph coloring problem (GCP): DSATUR and RLF.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00451266
Contributor : Kaoutar Sghiouer <>
Submitted on : Thursday, January 28, 2010 - 4:17:06 PM
Last modification on : Wednesday, July 4, 2018 - 4:44:02 PM
Long-term archiving on: : Friday, June 18, 2010 - 5:10:23 PM

File

LT09-027.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00451266, version 1

Collections

Citation

Yu Li, C. Lucet, Aziz Moukrim, Kaoutar Sghiouer. Greedy Algorithms for the Minimum Sum Coloring Problem. Logistique et transports, Mar 2009, Sousse, Tunisia. pp.LT-027. ⟨hal-00451266⟩

Share

Metrics

Record views

273

Files downloads

2778