Emergent Mind
An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
(1510.07773)
Published Oct 27, 2015
in
cs.DS
Abstract
In this paper, we show that there is an O(log k log2 n)-competitive randomized algorithm for the k-sever problem on any metric space with n points, which improved the previous best competitive ratio O(log2 k log3 n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267-276).
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.