An improved algorithm for online coloring of intervals with bandwidth

Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy

Research output: Contribution to journalArticlepeer-review

Abstract

We present an improved online algorithm for coloring interval graphs with bandwidth. This problem has recently been studied by Adamy and Erlebach and a 195-competitive online strategy has been presented. We improve this by presenting a 10-competitive strategy. To achieve this result, we use variants of an optimal online coloring algorithm due to Kierstead and Trotter.

Original languageEnglish
Pages (from-to)18-27
Number of pages10
JournalTheoretical Computer Science
Volume363
Issue number1
DOIs
StatePublished - 25 Oct 2006

Keywords

  • Graph coloring
  • Interval graphs
  • Online algorithms

Fingerprint

Dive into the research topics of 'An improved algorithm for online coloring of intervals with bandwidth'. Together they form a unique fingerprint.

Cite this