k-server via multiscale entropic regularization

Problem Complexity and Method Efficiency in Optimization

A. Nemirovski and D. Yudin · 1983

Earlier work this paper cites.

Differential Inclusions: Set-Valued Maps and Viability Theory

Jean Pierre Aubin and A. Cellina · 1984

Earlier work this paper cites.

Competitive algorithms for server problems

Mark S. Manasse, Lyle A. McGeoch, and Daniel D. Sleator · 1990

Earlier work this paper cites.

Competitive paging algorithms

A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and Young N. E · 1991

Earlier work this paper cites.

A strongly competitive randomized paging algorithm

Lyle A. McGeoch and Daniel D. Sleator · 1991

Earlier work this paper cites.

Convex analysis and minimization algorithms, Volume I: Fundamentals

Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 1993

Earlier work this paper cites.

On the k k -server conjecture

Elias Koutsoupias and Christos H. Papadimitriou · 1995

Earlier work this paper cites.

Probabilistic approximations of metric spaces and its algorithmic applications

Yair Bartal · 1996

Earlier work this paper cites.

On approximating arbitrary metrices by tree metrics

Yair Bartal · 1998

Cited alongside, same era.

Online computation and competitive analysis

Allan Borodin and Ran El-Yaniv · 1998

Cited alongside, same era.

Finely-competitive paging

Avrim Blum, Carl Burch, and Adam Kalai · 1999

Cited alongside, same era.

A tight bound on approximating arbitrary metrics by tree metrics

Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar · 2004

Cited alongside, same era.

On metric Ramsey-type phenomena

Yair Bartal, Nathan Linial, Manor Mendel, and Assaf Naor · 2005

Cited alongside, same era.

Ramsey-type theorems for metric spaces with applications to online problems

Yair Bartal, Béla Bollobás, and Manor Mendel · 2006

Cited alongside, same era.

The k k -server problem

Elias Koutsoupias · 2009

Later among the works it cites.

A primal-dual randomized algorithm for weighted paging

Nikhil Bansal, Niv Buchbinder, and Joseph Naor · 2012

Later among the works it cites.

A regularization approach to metrical task systems

Jacob Abernethy, Peter Bartlett, Niv Buchbinder, and Isabelle Stanton · 2014

Later among the works it cites.

Competitive analysis via regularization

Niv Buchbinder, Shahar Chen, and Joseph (Seffi) Naor · 2014

Later among the works it cites.

A polylogarithmic-competitive algorithm for the k k -server problem

Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor · 2015

Later among the works it cites.

Convex optimization: Algorithms and complexity

Sébastien Bubeck · 2015

Later among the works it cites.