Online Interval Coloring and Variants

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].

[1]  H. A. Kierstead,et al.  The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..

[2]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[3]  Frits C. R. Spieksma,et al.  Interval selection: Applications, algorithms, and lower bounds , 2003, J. Algorithms.

[4]  Patrick Suppes,et al.  Foundational aspects of theories of measurement , 1958, Journal of Symbolic Logic.

[5]  Hal A. Kierstead,et al.  On-Line and First-Fit Coloring of Graphs That Do Not Induce P5 , 1995, SIAM J. Discret. Math..

[6]  Rajiv Raman,et al.  Buffer minimization using max-coloring , 2004, SODA '04.

[7]  Stephan Olariu,et al.  Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..

[8]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[9]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[10]  Jun Qin,et al.  Coloring interval graphs with first-fit , 1995, Discret. Math..

[11]  N. S. Narayanaswamy,et al.  Dynamic Storage Allocation and On-Line Colouring Interval Graphs , 2004, COCOON.

[12]  Thomas Erlebach,et al.  Online Coloring of Intervals with Bandwidth , 2003, WAOA.

[13]  Marek Chrobak,et al.  On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..

[14]  Leah Epstein,et al.  The maximum resource bin packing problem , 2005, Theor. Comput. Sci..

[15]  Bettina Speckmann,et al.  Off-line Admission Control for Advance Reservations in Star Networks , 2004, WAOA.

[16]  Issie Rabinovitch,et al.  The Scott-Suppes theorem on semiorders , 1977 .