A Polylogarithmic-Competitive Algorithm for the k-Server Problem

Details A Polylogarithmic-Competitive Algorithm for the k-Server Problem A Polylogarithmic-Competitive Algorithm for the k-Server Problem

2011-10-07

arxiv.org/abs/1110.1580v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 O(log^3 n log^2 k log log n) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [J.ACM'95] whenever n is sub-exponential in k.

Affiliated with

Also associated with

No associations

Rating

A Polylogarithmic-Competitive Algorithm for the k-Server Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Polylogarithmic-Competitive Algorithm for the k-Server Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polylogarithmic-Competitive Algorithm for the k-Server Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133448