A Polylogarithmic-Competitive Algorithm for the k-Server Problem
From MaRDI portal
Publication:5494971
DOI10.1109/FOCS.2011.63zbMATH Open1292.68153OpenAlexW2069121074MaRDI QIDQ5494971FDOQ5494971
Authors: N. Bansal, Niv Buchbinder, Aleksander Mądry, Joseph (Seffi) Naor 
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/focs.2011.63
Cited In (18)
- Serving Online Requests with Mobile Servers
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- Local embeddings of metric spaces
- Breaking the 2-competitiveness barrier for two servers in a tree
- On the advice complexity of the \(k\)-server problem
- Metrical service systems with multiple servers
- The k-Server Problem with Delays on the Uniform Metric Space
- A technique to obtain hardness results for randomized online algorithms -- a survey
- R-LINE: a better randomized 2-server algorithm on the line
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Time efficient implementation for online \(k\)-server problem on trees
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- Improved and deterministic online service with deadlines or delay
- Prioritized metric structures and embedding
- Adversarial bandits with knapsacks
- The fast algorithm for online \(k\)-server problem on trees
- Pattern matching under DTW distance
This page was built for publication: A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494971)
