Randomized algorithm for the k-server problem on decomposable spaces

Judit Nagy-György

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 gro…