Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees
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 planar graphs and partial k-trees.
Unable to display preview. Download preview PDF.
- 9.Marx, D.: Complexity results for minimum sum edge multicoloring. (Manuscript)Google Scholar