Multi-coloring trees

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Scheduling jobs with pairwise conflicts is modeled by the graph multi-coloring problem. It occurs in two versions: preemptive and non-preemptive. We study these problems 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.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings
EditorsShin-ichi Nakano, Hideki Imai, D.T. Lee, Takeshi Tokuyama, Takao Asano
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540662006, 9783540662006
StatePublished - 1999
Event5th Annual International Conference on Computing and Combinatorics, COCOON 1999 - Tokyo, Japan
Duration: 26 Jul 199928 Jul 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th Annual International Conference on Computing and Combinatorics, COCOON 1999

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.


Dive into the research topics of 'Multi-coloring trees'. Together they form a unique fingerprint.

Cite this