Affiliation:
1. Technical University of Eindhoven
2. Tel Aviv University
3. Massachusetts Institute of Technology
4. Technion
Abstract
We give the first polylogarithmic-competitive randomized online algorithm for the
k
-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log
3
n
log
2
k
) for any metric space on
n
points. Our algorithm improves upon the deterministic (2
k
-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of
n
.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献