Randomized algorithm for the k-server problem on decomposable spaces

Authors:
Judit Nagy-GyöRgy
Affiliations:
Department of Mathematics, University of Szeged, Aradi vértanúk tere 1, H-6720 Szeged, Hungary
Venue:
Journal of Discrete Algorithms
Year:
2009

Citing 9
Cited 0

Competitive algorithms for server problems

Journal of Algorithms
Competitive paging algorithms

Journal of Algorithms
A Graph-Theoretic Game and its Application to the $k$-Server Problem

SIAM Journal on Computing
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
A randomized on–line algorithm for the k–server problem on a line

Random Structures & Algorithms
Ramsey-type theorems for metric spaces with applications to online problems

Journal of Computer and System Sciences - Special issue on FOCS 2001
A randomized algorithm for the on-line weighted bipartite matching problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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(logk). 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.