k-Servers with a Smile: Online Algorithms via Projections
Not on the map. Why?
Abstract (arXiv)
We consider the k-server problem on trees and HSTs. We give an algorithm based on Bregman projections. This algorithm has a competitive ratios that match some of the recent results given by Bubeck et al. (STOC 2018), whose algorithm was based on mirror-descent-based continuous dynamics prescribed via a differential inclusion.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
3 papers.
- 2022Online Algorithms with Multiple Predictionscited by 22
- 2023Online Covering with Multiple Expertscited by 1
- 2026Online Algorithms via Minimax and Posterior Matchingcited by 0
- 2026Online Algorithms via Minimax and Posterior Matching3 Aug 2026
- 2023Online Covering with Multiple Experts22 Dec 2023
- 2022Online Algorithms with Multiple Predictions8 May 2022