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–202
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–401
3. Bar-Noy A, Kortsarz G (1998) Minimum color sum of bipartite graphs. J Algorithms 28(2):339–365
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–137
5. Berliner A, Bostelmann U, Brualdi RA, Deaett L (2006) Sum list coloring graphs. Graphs Comb 22(2):173–183