K-servers with a smile: Online algorithms via projections

Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish
Pages98-116
Number of pages19
DOIs
StatePublished - 2019
Event30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States
Duration: 6 Jan 20199 Jan 2019

Conference

Conference30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/TerritoryUnited States
CitySan Diego
Period6/01/199/01/19

Fingerprint

Dive into the research topics of 'K-servers with a smile: Online algorithms via projections'. Together they form a unique fingerprint.

Cite this