Greedy Algorithms for the Minimum Sum Coloring Problem
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...