Online interval coloring and variants

Authors:
Leah Epstein;Meital Levy
Affiliations:
Department of Mathematics, University of Haifa, Haifa, Israel;School of Computer Science, Tel-Aviv University, Israel
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 6
Cited 10

The linearity of first-fit coloring of interval graphs

SIAM Journal on Discrete Mathematics
Simple linear time recognition of unit interval graphs

Information Processing Letters
Coloring interval graphs with First-Fit

Discrete Mathematics
On the online bin packing problem

Journal of the ACM (JACM)
Interval selection: applications, algorithms, and lower bounds

Journal of Algorithms
Buffer minimization using max-coloring

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

2005: an offline persepctive

ACM SIGACT News
The maximum resource bin packing problem

Theoretical Computer Science
Online interval coloring with packing constraints

Theoretical Computer Science
On the max coloring problem

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Variable sized online interval coloring with bandwidth

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online interval coloring with packing constraints

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The maximum resource bin packing problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A randomized algorithm for online unit clustering

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
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.01

Visualization

Abstract

We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without bandwidth and a new problem called lazy online coloring again with and without bandwidth. We consider both general interval graphs and unit interval graphs. Specifically, we establish the difference between the two main problems which are interval coloring with and without bandwidth. We present the first non-trivial lower bound of 3.2609 for the problem with bandwidth. This improves the lower bound of 3 that follows from the tight results for interval coloring without bandwidth presented in [9].