Minimum sum multicoloring on the edges of trees

Authors:
Dániel Marx
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
Theoretical Computer Science - Approximation and online algorithms
Year:
2006

Citing 8
Cited 3

Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Discrete Applied Mathematics
Approximation results for the optimum cost chromatic partition problem

Journal of Algorithms
Edge-chromatic sum of trees and bounded cyclicity graphs

Information Processing Letters
Sum multicoloring of graphs

Journal of Algorithms
The Complexity of Tree Multicolorings

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Optimum Cost Chromatic Partition Problem

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Multicoloring trees

Information and Computation
On sum coloring of graphs

Discrete Applied Mathematics

Sum edge coloring of multigraphs via configuration LP

ACM Transactions on Algorithms (TALG)
Minimum sum set coloring of trees and line graphs of trees

Discrete Applied Mathematics
On a local protocol for concurrent file transfers

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

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 edge 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. We also show that the problem is strongly NP-hard for trees, even if every demand is at most 2.