An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
Data Structures and Algorithms
2015-10-28 v1
Abstract
In this paper, we show that there is an O(log k log^2 n)-competitive randomized algorithm for the k-sever problem on any metric space with n points, which improved the previous best competitive ratio O(log^2 k log^3 n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267-276).
Cite
@article{arxiv.1510.07773,
title = {An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem},
author = {Wenbin Chen},
journal= {arXiv preprint arXiv:1510.07773},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1410.4955