Sum coloring of bipartite graphs with bounded degree

Algorithmica (New York)

Volumn 40, Issue 4, 2004, Pages 235-244

  Malafiejski, Michal ^a   Giaro, Krzysztof ^a   Janczewski, Robert ^a   Kubale, Marek ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Bipartite graphs; Chromatic sum; Sum coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; BIPARTITE GRAPHS; CHROMATIC SUM; SUM COLORING;

GRAPH THEORY;

EID: 21044452478     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1111-4     Document Type: Conference Paper

References (13)

1. Bar-Noy A., Bellare M., Halldórsson M.M., Shachnai H., Tamir T.: On chromatic sums and distributed resource allocation. Information and Computation 140 (1998), 183-202.
2. Bar-Noy A., Kortsarz G.: Minimum color sum of bipartite graphs. Journal of Algorithms 28 (1998). 339-365.
3. Dyer M.E., Frieze A.M.: Planar 3DM is NP-complete. Journal of Algorithms 7 (1986), 174-184.
4. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
5. Giaro K., Janczewski R., Kubale M., Małafiejski M.: A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. Proceedings of APPROX 2002 (Italy, Rome), pp. 135-145 LNCS 2462. Springer-Verlag, Berlin, 2002.
6. Giaro K., Kubale M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Information Processing Letters 75 (2000), 65-69.
7. Halldórsson M.M., Kortsarz G.: Multicoloring planar graphs and partial k-trees, Proceedings of the Second International Workshop on Approximation Algorithms (APPROX '99), pp. 73-84 LNCS 1671.
8. Halldórsson M.M., Kortsarz G., Shachnai H.: Sum coloring interval graphs and k-claw free graphs with applications for scheduling dependent jobs. Algorithmica 37 (2003), 187-209.
9. Kubicka E., Schwenk A.J.: An introduction to chromatic sums. Proceedings of ACM Computer Science Conference (1989), pp. 39-45.
10. Małafiejski M.: The complexity of the chromatic sum problem on planar graphs and regular graphs. The First Cologne Twente Workshop on Graphs and Combinatorial Optimization, Cologne (2001). Electronic Notes in Discrete Mathematics 8. Elsevier, Amsterdam, 2001.
11. Małafiejski M.: Scheduling Multiprocessor Tasks to Minimize Mean Flow Time (in Polish). Ph.D. Thesis, Gdańsk University of Technology (2002).
12. Nicoloso S., Sarrafzadeh M., Song X.: On the sum coloring problem on interval graphs. Algorithmica 23(1999), 109-126.
13. Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. PrenticeHall, Englewood Cliffs, NJ, 1982.