Abstract
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to vertex e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper is a polynomial time approximation scheme for minimum sum multicoloring the edges of trees.
Research is supported in part by grants OTKA 44733, 42559 and 42706 of the Hungarian National Science Fund.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bar-Noy, A., Halldórsson, M.M., Kortsarz, G., Salman, R., Shachnai, H.: Sum multicoloring of graphs. J. Algorithms 37(2), 422–450 (2000)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744–780 (1985)
Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inform. Process. Lett. 75(1-2), 65–69 (2000)
Halldórsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms 42(2), 334–366 (2002)
Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multicoloring trees. Inform. and Comput. 180(2), 113–129 (2003)
Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math. 55(3), 259–272 (1994)
Salavatipour, M.R.: On sum coloring of graphs. Discrete Appl. Math. 127(3), 477–488 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marx, D. (2004). Minimum Sum Multicoloring on the Edges of Trees. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive