CHECKCOL: Improved local search for graph coloring

Authors:
Massimiliano Caramia;Paolo Dell'olmo;Giuseppe F. Italiano
Affiliations:
Istituto per le Applicazioni del Calcolo "M. Picone", Viale del Policlinico, 137, 00161 Roma, Italy;Dipartimento di Statistica, Probabilití e Statistiche Applicate, Universití di Roma "La Sapienza", Piazzale Aldo Moro, 5, 00185 Roma, Italy;Dipartimento di Informatica, Sistemi e Produzione, Universití di Roma "Tor Vergata", Viale del Politecnico, 1, 00133 Roma, Italy
Venue:
Journal of Discrete Algorithms
Year:
2006

Citing 10
Cited 0

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

IEEE Transactions on Computers
Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
ATOM: a system for building customized program analysis tools

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Register allocation in structured programs

Journal of Algorithms - Special issue on SODA '95 papers
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Meta-Heuristics: Theory and Applications

Meta-Heuristics: Theory and Applications
Tabu Search

Tabu Search
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel coloring algorithm based on local search. We analyze its performance, and report several experimental results on DIMACS benchmark graphs. From our experiments, this algorithm looks robust, and yields a substantial speed up on previous algorithms for coloring. Our algorithm improves the best known coloring for four different DIMACS benchmark graphs: namely, Le450-25c, Le450-25d and Flat300_28_0 and Flat1000_76_0. Furthermore, we have run experiments on a simulator to get insights on its cache consciousness: from these experiments, it appears that the algorithm performs substantially less cache misses than other existing algorithms.