Matched approximation bound for the sum of a greedy coloring

Information Processing Letters

Volumn 71, Issue 3, 1999, Pages 135-140

  Bar Noy, Amotz ^a   Halldórsson, Magnús M ^b,d   Kortsarz, Guy ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF ICELAND   (Iceland)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

GRAPH COLORING; SUM COLORING PROBLEMS;

GRAPH THEORY;

EID: 0033609577     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00104-0     Document Type: Article

References (9)

1. [1] A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai, T. Tamir, On chromatic sums and distributed resource allocation, Inform. and Comput. 140 (1998) 183-202.
2. [2] A. Bar-Noy, M.M. Halldórsson, G. Kortsarz, R. Salman, H. Shachnai, Sum multi-coloring of graphs, in: Proc. 8th European Symp. on Algorithms, Lecture Notes in Computer Sci., Springer, Berlin, 1999.
3. [3] A. Bar-Noy, G. Kortsarz, The minimum color-sum of bipartite graphs, J. of Algorithms 28 (1998) 339-365.
4. [4] E. Kubicka, The chromatic sum of a graph, Ph.D. thesis, Western Michigan University, 1989.
5. [5] E. Kubicka, G. Kubicki, D. Kountanis, Approximation algorithms for the chromatic sum, in: Proc. of the First Great Lakes Computer Science Conf., Lecture Notes in Computer Sci. 507, Springer, Berlin, 1989, pp. 15-21.
6. [6] E. Kubicka, A.J. Schwenk, An introduction to chromatic sums, in: Proc. 17th Annual ACM Computer Science Conference, "Computing trends in the 1990's", 1989, pp. 39-45.
7. [7] D.S. Johnson, Worst case behaviour of graph coloring algorithms, in: Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing. Congressus Numerantium X, 1974, pp. 513-527.
8. [8] S. Nicoloso, M. Sarrafzadeh, X. Song, On the sum coloring problem on interval graphs, Algorithmica 23 (1999) 109-126.
9. [9] C. Thomassen, P. Erdös, Y. Alavi, J. Malde, A.J. Schwenk, Tight bounds on the chromatic sum of a connected graph, J. Graph Theory 13 (1989) 353-357.