Sciweavers

Share
COCOON
1999
Springer

Multi-coloring Trees

10 years 5 months ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, while in the non-preemptive case, the set of colors assigned to each vertex has to be contiguous. We study these versions of the multicoloring problem on trees, under the sum-of-completiontimes objective. In particular, we give a quadratic algorithm for the non-preemptive case, and a faster algorithm in the case that all job lengths are short, while we present a polynomialtime approximation scheme for the preemptive case.
Magnús M. Halldórsson, Guy Kortsarz,
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where COCOON
Authors Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
Comments (0)
books