k-Servers with a Smile: Online Algorithms via Projections

10/17/2018
by   Niv Buchbinder, et al.
0

We consider the k-server problem on trees and HSTs. We give an algorithms based on 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset