Online Capacitated Interval Coloring

In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2,..., n} with bandwidth bj. Initially a vector of capacities (c1, c2,..., cn) is given. Each color can support a set of requests such that the total bandwidth of intervals containing i is at most ci. The goal is to color the requests using a minimum number of colors. We present a constant competitive algorithm for the case where the maximum bandwidth bmax = maxj bj is at most the minimum capacity cmin = mini ci. For the case bmax > cmin, we give an algorithm with competitive ratio O(log bmax/cmin) and, using resource augmentation, a constant competitive algorithm. We also give a lower bound showing that constant competitive ratio cannot be achieved in this case without resource augmentation.

[1]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

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

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

[4]  Amos Fiat,et al.  An improved algorithm for online coloring of intervals with bandwidth , 2006, Theor. Comput. Sci..

[5]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

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

[7]  Chandra Chekuri,et al.  Multicommodity Demand Flow in a Tree , 2003, ICALP.

[8]  András Gyárfás,et al.  On-line and first fit colorings of graphs , 1988, J. Graph Theory.

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

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

[11]  Leah Epstein,et al.  Online Interval Coloring with Packing Constraints , 2005, MFCS.

[12]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[13]  Baruch Schieber,et al.  A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.

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

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

[16]  Leah Epstein,et al.  Online Interval Coloring and Variants , 2005, ICALP.

[17]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, APPROX.

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