Abstract
The question whether the preemptive Sum Multicoloring (pSMC) problem is hard on paths was raised by Halldórsson et al. in [8]. The pSMC problem is a scheduling problem where the pairwise conflicting jobs are represented by a conflict graph, and the time lengths of jobs by integer weights on the nodes. The goal is to schedule the jobs so that the sum of their finishing times is minimized. In the paper we give an O(n3p) time algorithm for the pSMC problem on paths, where n is the number of nodes and p is the largest time length. The result easily carries over to cycles. © Springer-Verlag 2004.
Cite
CITATION STYLE
Kovács, A. (2004). Sum-multicoloring on paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2996, 68–80. https://doi.org/10.1007/978-3-540-24749-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
