Sciweavers

ICALP
2003
Springer
14 years 17 days ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
Online Capacitated Interval Coloring
Abstract. 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....
Leah Epstein, Thomas Erlebach, Asaf Levin