K-servers with a smile: Online algorithms via projections

Niv Buchbinder; Anupam Gupta; Marco Molinaro; Joseph Naor

doi:https://doi.org/10.1137/1.9781611975482.7

K-servers with a smile: Online algorithms via projections

Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor

Tel Aviv University, Technion - Israel Institute of Technology

Research output: Contribution to conference › Paper › peer-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 language	English
Pages	98-116
Number of pages	19
DOIs	https://doi.org/10.1137/1.9781611975482.7
State	Published - 2019
Event	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States Duration: 6 Jan 2019 → 9 Jan 2019

Conference

Conference	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/Territory	United States
City	San Diego
Period	6/01/19 → 9/01/19

All Science Journal Classification (ASJC) codes

Software
General Mathematics

Access to Document

https://doi.org/10.1137/1.9781611975482.7

Cite this

@conference{8351a25166de4b14bf638b6489ae1a1e,

title = "K-servers with a smile: Online algorithms via projections",

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.",

author = "Niv Buchbinder and Anupam Gupta and Marco Molinaro and Joseph Naor",

note = "Publisher Copyright: Copyright {\textcopyright} 2019 by SIAM.; 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 ; Conference date: 06-01-2019 Through 09-01-2019",

year = "2019",

doi = "https://doi.org/10.1137/1.9781611975482.7",

language = "الإنجليزيّة",

pages = "98--116",

}

TY - CONF

T1 - K-servers with a smile

T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019

AU - Buchbinder, Niv

AU - Gupta, Anupam

AU - Molinaro, Marco

AU - Naor, Joseph

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85066935067&partnerID=8YFLogxK

U2 - https://doi.org/10.1137/1.9781611975482.7

DO - https://doi.org/10.1137/1.9781611975482.7

M3 - محاضرة

SP - 98

EP - 116

Y2 - 6 January 2019 through 9 January 2019

ER -

K-servers with a smile: Online algorithms via projections

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this