Multicoloring trees

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2003 Information and Computation  
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-completion-times objective. In particular, we give a quadratic algorithm for the non-preemptive case, and a faster algorithm in the case that
more » ... job lengths are short, while we present a polynomial-time approximation scheme for the preemptive case.
doi:10.1016/s0890-5401(02)00032-9 fatcat:4jfprdb7nfc7pe6svjt3wyg2sa