An O(log k log2 n)-competitive Randomized Algorithm for the k-Sever Problem
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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.