k-Servers with a Smile: Online Algorithms via Projections
classification
💻 cs.DS
keywords
algorithmprojectionsalgorithmsbregmanbubeckcompetitiveconsidercontinuous
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.