Artificial Intelligence Review

, Volume 47, Issue 3, pp 367–394 | Cite as

Algorithms for the minimum sum coloring problem: a review

Article

Abstract

The minimum sum coloring problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical relevance, MSCP attracts increasing attention. The only existing review on the problem dates back to 2004 and mainly covers the history of MSCP and theoretical developments on specific graphs. In recent years, the field has witnessed significant progresses on approximation algorithms and practical solution algorithms. The purpose of this review is to provide a comprehensive inspection of the most recent and representative MSCP algorithms. To be informative, we identify the general framework followed by practical solution algorithms and the key ingredients that make them successful. By classifying the main search strategies and putting forward the critical elements of the reviewed methods, we wish to encourage future development of more powerful methods and motivate new applications.

Keywords

Sum coloring Approximation algorithms Heuristics and metaheuristics Local search Evolutionary algorithms 

References

  1. Bar-Noy A, Bellare M, Halldórsson MM, Shachnai H, Tamir T (1998) On chromatic sums and distributed resource allocation. Inf Comput 140:183–202MathSciNetCrossRefMATHGoogle Scholar
  2. Bar-Noy A, Halldórsson MM, Kortsarz G, Salman R, Shachnai H (1999) Sum multi-coloring of graphs. In: Nesetril J (ed) 7th annual european symposium on algorithms. Lecture notes in computer science, vol 1643. Springer, Heidelberg, pp 390–401Google Scholar
  3. Bar-Noy A, Kortsarz G (1998) Minimum color sum of bipartite graphs. J Algorithms 28(2):339–365MathSciNetCrossRefMATHGoogle Scholar
  4. Benlic U, Hao J-K (2012) A study of breakout local search for the minimum sum coloring problem. In: Bui L, Ong Y, Hoai N, Ishibuchi H, Suganthan P (eds) Simulated evolution and learnin. Lecture notes in computer science, vol 7673. Springer, Heidelberg, pp 128–137Google Scholar
  5. Berliner A, Bostelmann U, Brualdi RA, Deaett L (2006) Sum list coloring graphs. Graphs Comb 22(2):173–183MathSciNetCrossRefMATHGoogle Scholar
  6. Bonomo F, Durán G, Napoli A, Valencia-Pabon M (2015) A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs. Inf Process Lett 115(6–8):600–603MathSciNetCrossRefMATHGoogle Scholar
  7. Bonomo F, Valencia-Pabon M (2014) On the minimum sum coloring of \(P_4\)-sparse graphs. Graphs Comb 30(2):303–314MathSciNetCrossRefMATHGoogle Scholar
  8. Bouziri H, Jouini M (2010) A tabu search approach for the sum coloring problem. Electron Notes Discrete Math 36:915–922CrossRefMATHGoogle Scholar
  9. Borodin A, Ivan I, Ye Y, Zimny B (2012) On sum coloring and sum multi-coloring for restricted families of graphs. Theor Comput Sci 418:1–13MathSciNetCrossRefMATHGoogle Scholar
  10. Brélaz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251–256MathSciNetCrossRefMATHGoogle Scholar
  11. Douiri S, Elbernoussi S (2011) New algorithm for the sum coloring problem. Int J Contemp Math Sci 6:453–463MathSciNetMATHGoogle Scholar
  12. Douiri S, Elbernoussi S (2012) A new ant colony optimization algorithm for the lower bound of sum coloring problem. J Math Model Algorithms 11(2):181–192MathSciNetCrossRefMATHGoogle Scholar
  13. Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379–397MathSciNetCrossRefMATHGoogle Scholar
  14. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-Completeness. Ed. Freeman and Company, New YorkMATHGoogle Scholar
  15. Gendreau M, Potvin JY (2010) Handbook of metaheuristics. International series in operations research & management science. Springer, New YorkGoogle Scholar
  16. Hajiabolhassan H, Mehrabadi ML, Tusserkani R (2000) Minimal coloring and strength of graphs. Discrete Math 215(13):265–270MathSciNetCrossRefMATHGoogle Scholar
  17. Halldórsson MM, Kortsarz G, Shachnai H (2003) Sum coloring interval graphs and k-claw free graphs with applications for scheduling dependent jobs. Algorithmica 37:187–209MathSciNetCrossRefMATHGoogle Scholar
  18. Hao J-K (2012) Memetic algorithms in discrete optimization. In: Neri F, Cotta C, Moscato P (eds) Handbook of memetic algorithms. Studies in computational intelligence, Chap 6, vol 379. Springer, New York, pp 73–94CrossRefGoogle Scholar
  19. Helmar A, Chiarandini M (2011) A local search heuristic for chromatic sum. In L. Di Gaspero, A. Schaerf, T. Stützle (eds). Proceedings of the 9th Metaheuristics International Conference, pp. 161–170Google Scholar
  20. Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345–351MathSciNetCrossRefMATHGoogle Scholar
  21. Jansen K (2000) Approximation results for the optimum cost chromatic partition problem. J Algorithms 34(1):54–89MathSciNetCrossRefMATHGoogle Scholar
  22. Jiang T, West D (1999) Coloring of trees with minimum sum of colors. J Graph Theory 32(4):354–358MathSciNetCrossRefMATHGoogle Scholar
  23. Jin Y, Hao J-K (2016) Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf Sci 352–353:15–34CrossRefGoogle Scholar
  24. Jin Y, Hao J-K, Hamiez JP (2014) A memetic algorithm for the minimum sum coloring problem. Comput Oper Res 43:318–327MathSciNetCrossRefMATHGoogle Scholar
  25. Johnson DS, Mehrotra A, Trick MA (eds) (2008) Special issue on computational methods for graph coloring and its generalizations. Discrete Appl Math 156(2):145–146Google Scholar
  26. Kokosiński Z, Kwarciany K (2007) On sum coloring of graphs with parallel genetic algorithms. In: Beliczynski B, Dzielinski A, Iwanowski M, Ribeiro B (eds) Adaptive and natural computing algorithms. Lecture notes in computer science, vol 4431. Springer, Heidelberg, pp 211–219CrossRefGoogle Scholar
  27. Kosowski A (2009) A note on the strength and minimum color sum of bipartite graphs. Discrete Appl Math 157(11):2552–2554MathSciNetCrossRefMATHGoogle Scholar
  28. Kroon LG, Sen A, Deng H, Roy A (1996) The optimum cost chromatic partition problem for trees and interval graphs. In: International workshop on graph theoretical concepts in computer science, lecture notes in computer science, vol 1197. pp 279–292Google Scholar
  29. Kubicka E (1989) The chromatic sum of a graph. Ph.D. Thesis, Western Michigan UniversityGoogle Scholar
  30. Kubicka E (2004) The chromatic sum of a graph: history and recent developments. Int J Math Math Sci 30:1563–1573MathSciNetCrossRefMATHGoogle Scholar
  31. Kubicka E (2005) Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs. Ars Comb 76:193–201MathSciNetMATHGoogle Scholar
  32. Kubicka E, Kubicki G, Kountanis D (1991) Approximation algorithms for the chromatic sum. In: First great lakes computer science conference on computing in the 90’s, lecture notes in computer science, vol 507. pp 15–21Google Scholar
  33. Kubicka E, Schwenk AJ (1989) An introduction to chromatic sums. In: Proceedings of the 17th conference on ACM annual computer science conference, CSC ’89. ACM, New York, pp 39–45Google Scholar
  34. Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84(6):489–506MathSciNetCrossRefMATHGoogle Scholar
  35. Li Y, Lucet C, Moukrim A, Sghiouer K (2009) Greedy algorithms for the minimum sum coloring problem. Logistique et Transports Conference. https://hal.archives-ouvertes.fr/hal-00451266/document
  36. Malafiejski M (2004) Sum coloring of graphs. In: Kubale M (ed) Graph Colorings, vol 352., Contemporary mathematicsAmerican Mathematical Society, New Providence, pp 55–65CrossRefGoogle Scholar
  37. Malafiejski M, Giaro K, Janczewski R, Kubale M (2004) Sum coloring of bipartite graphs with bounded degree. Algorithmica 40(4):235–244MathSciNetCrossRefMATHGoogle Scholar
  38. Moukrim A, Sghiouer K, Lucet C, Li Y (2010) Lower bounds for the minimal sum coloring problem. Electron Notes Discrete Math 36:663–670CrossRefMATHGoogle Scholar
  39. Moukrim A, Sghiouer K, Lucet C, Li Y (2013) Upper and lower bounds for the minimum sum coloring problem, submitted for publication. https://www.hds.utc.fr/~moukrim/dokuwiki/doku.php?id=en:mscp
  40. Nicoloso S, Sarrafzadeh M, Song X (1999) On the sum coloring problem on interval graphs. Algorithmica 23:109–126MathSciNetCrossRefMATHGoogle Scholar
  41. Salavatipour MR (2003) On sum coloring of graphs. Discrete Appl Math 127(3):477–488MathSciNetCrossRefMATHGoogle Scholar
  42. Sen A, Deng H, Guha S (1992) On a graph partition problem with application to VLSI layout. Inf Process Lett 43(2):87–94MathSciNetCrossRefMATHGoogle Scholar
  43. Supowit KJ (1987) Finding a maximum planar subset of a set of nets in a channel. IEEE Trans Comput Aided Design CAD 6(1):93–94CrossRefGoogle Scholar
  44. Thomassen C, Erds P, Alavi Y, Malde P, Schwenk A (1989) Tight bounds on the chromatic sum of a connected graph. J Graph Theory 13:353–357MathSciNetCrossRefMATHGoogle Scholar
  45. Wang Y, Hao JK, Glover, F, Lü Z (2013) Solving the minimum sum coloring problem via binary quadratic programming. CoRRarXiv:1304.5876
  46. Wu Q, Hao J-K (2012) An effective heuristic algorithm for sum coloring of graphs. Comput Oper Res 39(7):1593–1600MathSciNetCrossRefMATHGoogle Scholar
  47. Wu Q, Hao J-K (2012) Improving the extraction and expansion method for large graph coloring. Discrete Appl Math 160(16–17):2397–2407MathSciNetMATHGoogle Scholar
  48. Wu Q, Hao JK (2013) Improved lower bounds for sum coloring via clique decomposition. CoRRarXiv:1303.6761

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina
  2. 2.LERIAUniversité d’AngersAngersFrance
  3. 3.Institut Universitaire de FranceParisFrance

Personalised recommendations