CHECKCOL: Improved local search for graph coloring

Journal of Discrete Algorithms

Volumn 4, Issue 2, 2006, Pages 277-298

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b   Italiano, Giuseppe F ^c  

^a CNR   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Combinatorial optimization; Graph coloring; Local search

Indexed keywords

ALGORITHMS; BENCHMARKING; CACHE MEMORY; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; ROBUSTNESS (CONTROL SYSTEMS);

COMBINATORIAL OPTIMIZATION; DIMACS; GRAPH COLORING; LOCAL SEARCH;

COLOR COMPUTER GRAPHICS;

EID: 33747780121     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.03.006     Document Type: Article

References (26)

1. Bianco L., Caramia M., and Dell'Olmo P. Solving a preemptive scheduling problem using coloring technique. In: Weglarz J. (Ed). Project Scheduling Recent Models, Algorithms and Applications (1998), Kluwer Academic, Dordrecht
2. Blazewicz J., Ecker K.H., Pesch E., Schmidt G., and Weglarz J. Scheduling Computer and Manufacturing Processes (1996), Springer, Berlin
3. Cangalovic M., and Schreuder J. Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths. EJOR 51 (1991) 248-258
4. Caramia M., and Dell'Olmo P. A fast and simple local search for graph coloring. Proc. of the 3rd Workshop on Algorithm Engineering (WAE'99). Lecture Notes in Comput. Sci. vol. 1618 (1999) 319-333
5. Chams M., Hertz A., and De Werra D. Some experiments with simulated annealing for coloring graphs. EJOR 32 (1987) 260-266
6. Coffman E.G. An introduction to combinatorial models of dynamic storage allocation. SIAM Rev. 25 (1983) 311-325
7. DIMACS ftp site for benchmark graphs:. ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color/
8. DIMACS ftp site for benchmark machines:. ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/volume/machine
9. Dailey D.P. Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30 (1980) 289-293
10. De Werra D. An introduction to timetabling. European J. Oper. Res. 19 (1985) 151-162
11. Eiben A.E., Van Der Hauw J.K., and Van Hemert J.I. Graph coloring with adaptive evolutionary algorithms. J. Heuristics 4 (1998) 25-46
12. Fleurent C., and Ferland J.A. Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63 (1995) 437-461
13. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976) 237-267
14. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic, Dordrecht
15. Hertz A., and De Werra D. Using tabu search techniques for graph coloring. Computing 39 (1987) 345-351
16. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning. Oper. Res. 39 (1991) 378-406
17. Kannan S., and Proebsting T. Register allocation in structured programs. J. Algorithms 29 (1998) 223-237
18. Krawczyk H., and Kubale M. An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. C-34 (1985) 869-872
19. Leighton F.T. A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Standards 84 (1979) 412-418
20. Lewandowski G. Experiments with parallel graph coloring heuristics. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS, Providence, RI
21. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Proc. 25th Annual ACM Symp. on Theory of Computing (1993) 286-293 (Full version in
22. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. J. ACM 41 5 (1994) 960-981 )
23. Morgenstern C. Distributed coloration neighborhood search. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS, Providence, RI 335-358
24. Osman I.H., and Kelley J.P. Metaheuristics: Theory and Applications (1996), Kluwer Academic, Hingam, MA
25. Sewell E.C. An improved algorithm for exact graph coloring. In: Johnson D.S., and Trick M.A. (Eds). DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS, Providence, RI 359-373
26. Srivastava A., and Eustace A. ATOM: A system for building customized program analysis tools. Proc. ACM Symp. on Programming Languages, Design and Implementation (1994) 196-205