Abstract:We study the k-server problem with time-windows. In this problem, each request i arrives at some point v i of an n-point metric space at time b i and comes with a deadline e i . One of the k servers must be moved to v i at some time in the interval [b i , e i ] to satisfy this request. We give an online algorithm for this problem with a competitive ratio of poly log(n, ∆), where ∆ is the aspect ratio of the metric space. Prior to our work, the best competitive ratio known for this problem was O(k poly log(n)) … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.