An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem (1510.07773v1)

Published 27 Oct 2015 in cs.DS

Abstract: In this paper, we show that there is an O(log k log² 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² k log³ n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267-276).

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Wenbin Chen

Collections

Sign up for free to add this paper to one or more collections.