Heuristic Algorithms for the Set-Coloring Problem

In this paper we develop two heuristic algorithms for the set coloring problem. The first algorithm, SetCol, is a new greedy algorithm and the second uses an extended version of Dsatur algorithm suitably adapted to solve the set coloring problem. The empirical results on random instances show that SetCol algorithm gives encouraging results