TY - GEN

T1 - Online capacitated interval coloring

AU - Epstein, Leah

AU - Erlebach, Thomas

AU - Levin, Asaf

PY - 2007

Y1 - 2007

N2 - 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 = min1 c i. For the case bmax > cmin, we give an algorithm with competitive ratio 0(log cminbmax) 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.

AB - 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 = min1 c i. For the case bmax > cmin, we give an algorithm with competitive ratio 0(log cminbmax) 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.

UR - http://www.scopus.com/inward/record.url?scp=38049055921&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74450-4_22

DO - 10.1007/978-3-540-74450-4_22

M3 - Conference contribution

AN - SCOPUS:38049055921

SN - 9783540744498

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 243

EP - 254

BT - Combinatorics, Algorithms, Probabilistic and Experimental Methodologies - First International Symposium, ESCAPE 2007, Revised Selected Papers

PB - Springer Verlag

T2 - 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007

Y2 - 7 April 2007 through 9 April 2007

ER -