Title :
Heuristic Algorithms for the Set-Coloring Problem
Author :
Satratzemi, Maya
Author_Institution :
Dept. of Appl. Informatics, Macedonia Univ., Thessaloniki
Abstract :
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
Keywords :
graph colouring; greedy algorithms; set theory; Dsatur algorithm; SetCol algorithm; greedy algorithm; heuristic algorithm; set-coloring problem; Algorithm design and analysis; Bandwidth; Financial advantage program; Frequency; Greedy algorithms; Heuristic algorithms; Informatics; Interference constraints; NP-complete problem; Radio transmitters;
Conference_Titel :
Information and Communication Technologies, 2006. ICTTA '06. 2nd
Conference_Location :
Damascus
Print_ISBN :
0-7803-9521-2
DOI :
10.1109/ICTTA.2006.1684858
