An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
Wenbin Chen
TL;DR
This paper presents a new randomized algorithm for the k-sever problem that achieves a significantly improved competitive ratio of O(log k log^2 n) across any metric space, surpassing previous results.
Contribution
The authors introduce an O(log k log^2 n)-competitive randomized algorithm for the k-sever problem, improving upon the prior best bounds.
Findings
Achieved a new competitive ratio of O(log k log^2 n)
Applicable to any metric space with n points
Surpasses previous competitive ratio bounds
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Complexity and Algorithms in Graphs · Facility Location and Emergency Management