Randomized algorithm for the k-server problem on decomposable spaces

Details Randomized algorithm for the k-server problem on decomposable spaces Randomized algorithm for the k-server problem on decomposable spaces

2007-08-17

arxiv.org/abs/0708.2351v1

Computer Science

Data Structures and Algorithms

11 pages

Scientific paper

We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the growth rate of the competitive quotients being at most O(log k). This method yields o(k)-competitive algorithms solving the randomized k-server problem, for some special underlying metric spaces, e.g. HSTs of "small" height (but unbounded degree). HSTs are important tools for probabilistic approximation of metric spaces.

Affiliated with

Also associated with

No associations

Rating

Randomized algorithm for the k-server problem on decomposable spaces 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 Randomized algorithm for the k-server problem on decomposable spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized algorithm for the k-server problem on decomposable spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5910