An improved algorithm for online coloring of intervals with bandwidth

Authors:
Yossi Azar;Amos Fiat;Meital Levy;N. S. Narayanaswamy
Affiliations:
School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel;Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
Theoretical Computer Science - Computing and combinatorics
Year:
2006

Citing 3
Cited 4

A polynomial time approximation algorithm for Dynamic Storage Allocation

Discrete Mathematics
Coloring interval graphs with First-Fit

Discrete Mathematics
Online computation and competitive analysis

Online computation and competitive analysis

Online interval coloring with packing constraints

Theoretical Computer Science
Max-coloring and online coloring with bandwidths on interval graphs

ACM Transactions on Algorithms (TALG)
On the max coloring problem

Theoretical Computer Science
Online capacitated interval coloring

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

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.