A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Crmatic Sum Problem is NP-complete on planar bipartite graphs with ∇≤ 5, but polynomial on bipartite graphs with ∇≤ 3, for which we construct an O(n 2)-time algorithm. Hence, we tighten the borderline of intractability for this problem on bipartite graphs with bounded degree, namely: the case ∇ = 3 is easy, ∇ = 5 is hard. Moreover, we construct a 27/26-approximation algorithm for this problem thus improving the best known approximation ratio of 10/9.
Unable to display preview. Download preview PDF.
- 4.Garey M.R., ohnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)Google Scholar
- 5.Giaro K., Kubale M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Proc. Letters 75 (2000) 65–69Google Scholar
- 6.Kubicka E., Schwenk A.J.: An introduction to chromatic sums. Proceedings of ACM Computer Science Conference (1989) 39–45Google Scholar
- 7.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 (2001)Google Scholar
- 8.Małafiejski M.: Scheduling Multiprocessor Tasks to Minimize Mean FlowTime (in Polish), Ph.D. Thesis, Gdańsk University of Technology (2002)Google Scholar