k-Servers with a Smile: Online Algorithms via Projections

10/17/2018

∙

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

k-Servers with a Smile: Online Algorithms via Projections

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

A Fast Algorithm for Online k-servers Problem on Trees

Unbounded lower bound for k-server against weak adversaries

Strong Algorithms for the Ordinal Matroid Secretary Problem

Metrical task systems on trees via mirror descent and unfair gluing

A D-competitive algorithm for the Multilevel Aggregation Problem with Deadlines

Multi-finger binary search trees

k-Servers with a Smile: Online Algorithms via Projections

Related Research

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

A Fast Algorithm for Online k-servers Problem on Trees

Unbounded lower bound for k-server against weak adversaries

Strong Algorithms for the Ordinal Matroid Secretary Problem

Metrical task systems on trees via mirror descent and unfair gluing

A D-competitive algorithm for the Multilevel Aggregation Problem with Deadlines

Multi-finger binary search trees