Randomized algorithm for the k-server problem on decomposable spaces
Data Structures and Algorithms
2007-08-20 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.0708.2351,
title = {Randomized algorithm for the k-server problem on decomposable spaces},
author = {Judit Nagy-György},
journal= {arXiv preprint arXiv:0708.2351},
year = {2007}
}
Comments
11 pages