An effective heuristic algorithm for sum coloring of graphs

Given an undirected graph G = ( V , E ) , the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of G, using colors represented by natural numbers ( 1,2 , ? ) such that the total sum of the colors assigned to the vertices is minimized. In this paper, we present EXSCOL, a heuristic algorithm based on independent set extraction for this NP-hard problem. EXSCOL identifies iteratively collections of disjoint independent sets of equal size and assign to each independent set the smallest available color. For the purpose of computing large independent sets, EXSCOL employs a tabu search based heuristic. Experimental evaluations on a collection of 52 DIMACS and COLOR2 benchmark graphs show that the proposed approach achieves highly competitive results. For more than half of the graphs used in the literature, our approach improves the current best known upper bounds.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Mohammad R. Salavatipour,et al.  On Sum Coloring of Graphs , 2003, Discret. Appl. Math..

[3]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[4]  Sidi Mohamed Douiri,et al.  New Algorithm for the Sum Coloring Problem , 2011 .

[5]  Zbigniew Kokosinski,et al.  On Sum Coloring of Graphs with Parallel Genetic Algorithms , 2007, ICANNGA.

[6]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[7]  Leo G. Kroon,et al.  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.

[8]  Guy Kortsarz,et al.  Minimum Color Sum of Bipartite Graphs , 1998, J. Algorithms.

[9]  Y. Li,et al.  Lower Bounds for the Minimal Sum Coloring Problem , 2010, Electron. Notes Discret. Math..

[10]  Paolo Toth,et al.  A Metaheuristic Approach for the Vertex Coloring Problem , 2008, INFORMS J. Comput..

[11]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[12]  Ewa Kubicka,et al.  An introduction to chromatic sums , 1989, CSC '89.

[13]  Jin-Kao Hao,et al.  An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring , 2010, Comput. Oper. Res..

[14]  Aziz Moukrim,et al.  Greedy Algorithms for the Minimum Sum Coloring Problem , 2009 .

[15]  M. Trick,et al.  Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .

[16]  Hend Bouziri,et al.  A tabu search approach for the sum coloring problem , 2010, Electron. Notes Discret. Math..

[17]  Dionysios Kountanis,et al.  Approximation Algorithms for the Chromatic Sum , 1989, Great Lakes Computer Science Conference.

[18]  D. West,et al.  Coloring of trees with minimum sum of colors , 1999 .

[19]  Hossein Hajiabolhassan,et al.  Minimal coloring and strength of graphs , 2000, Discret. Math..

[20]  Klaus Jansen,et al.  Approximation Results for the Optimum Cost Chromatic Partition Problem , 1997, J. Algorithms.

[21]  Vahid Lotfi,et al.  A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..

[22]  Paul Erdös,et al.  Tight bounds on the chromatic sum of a connected graph , 1989, J. Graph Theory.

[23]  Jin-Kao Hao,et al.  Coloring large graphs based on independent set extraction , 2012, Comput. Oper. Res..

[24]  Javier Marenco,et al.  Minimum sum set coloring of trees and line graphs of trees , 2011, Discret. Appl. Math..

[25]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[26]  Jin-Kao Hao,et al.  An adaptive multistart tabu search approach to solve the maximum clique problem , 2013, J. Comb. Optim..