@inproceedings{buchbinder2019k-servers,
author = {Buchbinder, Niv and Gupta, Anupam and Molinaro, Marco and Naor, J.},
title = {k-Servers with a Smile: Online Algorithms via Projections},
booktitle = {SODA},
year = {2019},
month = {October},
abstract = {We consider the $k$-server problem on trees and HSTs. We give an algorithms based on %the convex-programming primitive of 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.},
url = {http://approjects.co.za/?big=en-us/research/publication/k-servers-with-a-smile-online-algorithms-via-projections/},
}