TY - JOUR
T1 - Multicoloring trees
AU - Halldórsson, Magnús M.
AU - Kortsarz, Guy
AU - Proskurowski, Andrzej
AU - Salman, Ravit
AU - Shachnai, Hadas
AU - Telle, Jan Arne
PY - 2003/1/29
Y1 - 2003/1/29
N2 - 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 all job lengths are short, while we present a polynomial-time approximation scheme for the preemptive case.
AB - 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 all job lengths are short, while we present a polynomial-time approximation scheme for the preemptive case.
KW - Approximation algorithms
KW - Multicoloring
KW - Resource allocation
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=0037471702&partnerID=8YFLogxK
U2 - 10.1016/S0890-5401(02)00032-9
DO - 10.1016/S0890-5401(02)00032-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0037471702
SN - 0890-5401
VL - 180
SP - 113
EP - 129
JO - Information and Computation
JF - Information and Computation
IS - 2
ER -