%0 Journal Article %1 BGMN18 %A Buchbinder, Niv %A Gupta, Anupam %A Molinaro, Marco %A Naor, Joseph %D 2018 %K K-Server %T $k$-Servers with a Smile: Online Algorithms via Projections %U http://arxiv.org/abs/1810.07508 %X We consider the $k$-server problem on trees and HSTs. We give an algorithms 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.

@article{BGMN18, abstract = {We consider the $k$-server problem on trees and HSTs. We give an algorithms 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.}, added-at = {2018-11-14T16:31:03.000+0100}, author = {Buchbinder, Niv and Gupta, Anupam and Molinaro, Marco and Naor, Joseph}, biburl = {https://www.bibsonomy.org/bibtex/2abba9c6690a5e9b51577886578666cb8/kammoradi}, description = {$k$-Servers with a Smile: Online Algorithms via Projections}, interhash = {f2979672c234f50a5e82077f99186b4a}, intrahash = {abba9c6690a5e9b51577886578666cb8}, keywords = {K-Server}, note = {cite arxiv:1810.07508}, timestamp = {2018-11-14T16:31:03.000+0100}, title = {$k$-Servers with a Smile: Online Algorithms via Projections}, url = {http://arxiv.org/abs/1810.07508}, year = 2018 }