Multicoloring planar graphs and partial k-trees

Magnús M. Halldórsson, Guy Kortsarz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationRandomization, Approximation, and Combinatorial Optimization
Subtitle of host publicationAlgorithms and Techniques - 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, Proceedings
EditorsJose D. P. Rolim, Alistair Sinclair, Dorit Hochbaum, Klaus Jansen
PublisherSpringer Verlag
Pages73-84
Number of pages12
ISBN (Print)3540663290, 9783540663294
DOIs
StatePublished - Jan 1 1999
Externally publishedYes
Event3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999 - Berkeley, United States
Duration: Aug 8 1999Aug 11 1999

Publication series

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

Other

Other3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999
CountryUnited States
CityBerkeley
Period8/8/998/11/99

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Multicoloring planar graphs and partial k-trees'. Together they form a unique fingerprint.

Cite this