@inproceedings{3408eba7aeed4a4d949bed5b1688a6e6,
title = "Multicoloring planar graphs and partial k-trees",
abstract = "We study the multicoloring problem with two objective functions: minimizing the makespan and minimizing the multisum. We focus on partial k-trees and planar graphs. In particular, we give polynomial time approximation schemes (PTAS) for both classes, for both preemptive and non-preemptive multisum colorings.",
author = "Halld{\'o}rsson, {Magn{\'u}s M.} and Guy Kortsarz",
year = "1999",
month = jan,
day = "1",
doi = "10.1007/978-3-540-48413-4_8",
language = "English (US)",
isbn = "3540663290",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "73--84",
editor = "Rolim, {Jose D. P.} and Alistair Sinclair and Dorit Hochbaum and Klaus Jansen",
booktitle = "Randomization, Approximation, and Combinatorial Optimization",
address = "Germany",
note = "3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999 ; Conference date: 08-08-1999 Through 11-08-1999",
}