Coloring graphs by iterated local search traversing feasible and infeasible solutions

  • Authors:

  • Massimiliano Caramia;Paolo Dell'Olmo

  • Affiliations:

  • Dipartimento di Ingegneria dell'Impresa, Universití di Roma "Tor Vergata", Via del Politecnico, 1 - 00133 Roma, Italy;Dipartimento di Statistica, Probabilití e Statistiche Applicate, Universití di Roma "La Sapienza", Piazzale Aldo Moro, 5 - 00185 Roma, Italy

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.05

Visualization

Abstract

Graph coloring is one of the hardest combinatorial optimization problems for which a wide variety of algorithms has been proposed over the last 30 years. The problem is as follows: given a graph one has to assign a label to each vertex such that no monochromatic edge appears and the number of different labels used is minimized. In this paper we present a new heuristic for this problem which works with two different functionalities. One is defined by two greedy subroutines, the former being a greedy constructive one and the other a greedy modification one. The other functionality is a perturbation subroutine, which can produce also infeasible colorings, and the ability is then to retrieve feasible solutions. In our experimentation the proper tuning of this optimization scheme produced good results on known graph coloring benchmarks.