A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
2002
Journal of Algorithms
We study graph multicoloring problems, motivated by the scheduling of dependent jobs on multiple machines. In multicoloring problems, vertices have lengths which determine the number of colors they must receive, and the desired coloring can be either contiguous (non-preemptive schedule) or arbitrary (preemptive schedule). We consider both the sum-of-completion times measure, or the sum of the last color assigned to each vertex, as well as the more common makespan measure, or the number of
doi:10.1006/jagm.2001.1210
fatcat:eyi2w2ayy5ebjh62sehoxr7h6y