$k$-Servers with a Smile: Online Algorithms via Projections

Niv Buchbinder, Anupam Gupta, Marco Molinaro +2

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 resul…