Abstract
The problem of minimum color sum of a graph is to color the vertices of the graph such that the sum (average) of all assigned colors is minimum. Recently, in [BBH+96], it was shown that in general graphs this problem cannot be approximated within n 1−ɛ, for any ∈>0, unless NP=ZPP. In the same paper, a 9/8-approximation algorithm was presented for bipartite graphs. The hardness question for this problem on bipartite graphs was left open. In this paper we show that the minimum color sum problem for bipartite graphs admits no polynomial approximation scheme, unless P=NP. The proof is by L-reducing the problem of finding the maximum independent set in a graph whose maximum degree is four to this problem. This result indicates clearly that the minimum color sum problem is much harder than the traditional coloring problem which is trivially solvable in bipartite graphs. As for the approximation ratio, we make a further step towards finding the precise threshold. We present a polynomial 10/9-approximation algorithm. Our algorithm uses a flow procedure in addition to the maximum independent set procedure used in previous results.
The full version of this extended abstract can be found in URL http://www.eng.tau.ac.il/amotz/publications.html.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. of the 33'rd IEEE Symp. on the Foundations of Computer Science, pages 14–23, 1992.
A. Bar-Noy and G. Kortsarz. The Minimum Color Sum of Bipartite Graphs. In URL: http://www.eng.tau.ac.il/amotz/publications.html.
A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. In Proc. of the fourth Israel Symp. on Theory and Computing and Systems, pages 119–128, 1996. (Also in URL: http://www.eng.tau.ac.il/amotz/publications.html.)
K. Chandy and J. Misra. The Drinking Philosophers Problem. ACM Trans. Programming Languages and Systems, 6:632–646, 1984.
N. Christofides. Worst case analysis of a new heuristic for the traveling salesman problem. Technical report GSIA, Carnegie-Mellon Univ., 1976.
G. Gallo, M.D. Grigoriadis, and R.E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. on Comput., 18:30–55, 1989.
E. Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.
E. Kubicka, G. Kubicki, and D. Kountanis. Approximation Algorithms for the Chromatic Sum. In Proc. of the First Great Lakes Computer Science Con., Springer LNCS 507, pages 15–21, 1989.
E. Kubicka and A. J. Schwenk. An Introduction to Chromatic Sums. In Proc. of the ACM Computer Science Con., pages 39–45, 1989.
N. Lynch. Upper Bounds for Static Resource Allocation in a Distributed System. J. of Computer and System Sciences, 23:254–278, 1981.
C. H. Papadimitriou and M. Yannakakis. Optimization approximation and complexity classes. In Proc. of the 20'th IEEE Symp. on The Theory of Computing, pages 229–234, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Noy, A., Kortsarz, G. (1997). The minimum color sum of bipartite graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_227
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_227
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive