Abstract
The multicoloring problem is that given a graph G and integer demands x(v) for every vertex v, assign a set of x(v) colors to vertex v, such that neighboring vertices have disjoint sets of colors. In the preemptive sum multicoloring problem the finish time of a vertex is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The study of this problem is motivated by applications in scheduling. Answering a question of Halldórsson et al. [4], we show that the problem is strongly NP-hard in binary trees. As a first step toward this result we prove that list multicoloring of binary trees is NP-complete.
Research supported by grant OTKA 30122 of the Hungarian National Science Fund.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, and Hadas Shachnai. Sum multicoloring of graphs. J. Algorithms, 37(2):422–450, 2000.
Amotz Bar-Noy and Guy Kortsarz. Minimum color sum of bipartite graphs. J. Algorithms, 28(2):339–365, 1998.
Magnús M. Halldórsson and Guy Kortsarz. Multicoloring planar graphs and partial k-trees. In Randomization, approximation, and combinatorial optimization (Berkeley, CA, 1999), pages 73–84. Springer, Berlin, 1999.
Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, and Jan Arne Telle. Multi-coloring trees. In Computing and combinatorics (Tokyo, 1999), pages 271–280. Springer, Berlin, 1999.
M. Hujter and Zs. Tuza. Precoloring extension. II. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae, 62(1):1–11, 1993.
Klaus Jansen. The optimum cost chromatic partition problem. In Algorithms and complexity (Rome, 1997), pages 25–36. Springer, Berlin, 1997.
Klaus Jansen and Petra Scheffler. Generalized coloring for tree-like graphs. Discrete Appl. Math., 75(2):135–155, 1997.
J. Kratochvíl. Precoloring extension with fixed color bound. Acta Mathematica Universitatis Comenianae, 62(2):139–153, 1993.
Ewa Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.
Ewa Kubicka, Grzegorz Kubicki, and Dionisios Kountanis. Approximation algorithms for the chromatic sum. In Computing in the 90’s (Kalamazoo, MI, 1989), pages 15–21. Springer, Berlin, 1991.
Ewa Kubicka and Allan J. Schwenk. An introduction to chromatic sums. In Proceedings of the ACM Computer Science Conf., pages 15–21. Springer, Berlin, 1989.
S. Nicoloso, M. Sarrafzadeh, and X. Song. On the sum coloring problem on interval graphs. Algorithmica, 23(2):109–126, 1999.
Tibor Szkaliczki. Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM J. Comput., 29(1):274–287, 1999.
Zsolt Tuza. Graph colorings with local constraints—a survey. Discuss. Math. Graph Theory, 17(2):161–228, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marx, D. (2002). The Complexity of Tree Multicolorings. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_44
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive