Variable sized online interval coloring with bandwidth

Leah Epstein, Thomas Erlebach, Asaf Levin

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


We consider online coloring of intervals with bandwidth in a setting where colors have variable capacities. Whenever the algorithm opens a new color, it must choose the capacity for that color and cannot change it later. The goal is to minimize the total capacity of all the colors used. We consider the bounded model, where all capacities must be chosen in the range (0, 1], and the unbounded model, where the algorithm may use colors of any positive capacity. For the absolute competitive ratio, we give an upper bound of 14 and a lower bound of 4.59 for the bounded model, and an upper bound of 4 and a matching lower bound of 4 for the unbounded model. We also consider the offline version of these problems and show that the unbounded model is polynomially solvable, while the bounded model is NP-hard in the strong sense and admits a 3.6-approximation algorithm.

Original languageEnglish
Title of host publicationBiomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)354035753X, 9783540357537
StatePublished - 2006
Event10th Scandinavian Workshop on Algorithm Theory, SWAT 2006 - Riga, Latvia
Duration: 6 Jul 20068 Jul 2006

Publication series

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


Conference10th Scandinavian Workshop on Algorithm Theory, SWAT 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Variable sized online interval coloring with bandwidth'. Together they form a unique fingerprint.

Cite this