Fetching the paper…
Reading the bibliography…
We study online competitive algorithms for the \emph{line chasing problem} in Euclidean spaces $\reals^d$, where the input consists of an initial point $P_0$ and a sequence of lines $X_1,X_2,...,X_m$, revealed one at a time.
Competitive algorithms for server problems
Mark S. Manasse, Lyle A. McGeoch, and Daniel Dominic Sleator · 1990
Earlier work this paper cites.
An optimal on-line algorithm for metrical task system
Allan Borodin, Nathan Linial, and Michael E. Saks · 1992
Earlier work this paper cites.
On convex body chasing
Joel Friedman and Nathan Linial · 1993
Earlier work this paper cites.
On the k-server conjecture
Elias Koutsoupias and Christos H. Papadimitriou · 1995
Earlier work this paper cites.
On traversing layered graphs on-line
H. Ramesh · 1995
Earlier work this paper cites.
Traversing layered graphs using the work function algorithm
William R. Burley · 1996
Earlier work this paper cites.
Metrical task systems, the server problem and the work function algorithm
Marek Chrobak and Lawrence L. Larmore · 1996
Cited alongside, same era.
Competitive algorithms for layered graph traversal
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, and Sundar Vishwanathan · 1998
Cited alongside, same era.
Dynamic right-sizing for power-proportional data centers
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, and Eno Thereska · 2012
Cited alongside, same era.
The generalized work function algorithm is competitive for the generalized 2-server problem
René Sitters · 2014
Cited alongside, same era.
A 2-competitive algorithm for online convex optimization with switching costs
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, and Clifford Stein · 2015
Cited alongside, same era.
Chasing convex bodies and functions
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, and Michele Scquizzato · 2016
Later among the works it cites.
Nested convex bodies are chaseable
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, and Seeun William Umboh · 2018
Closest in time.
Chasing nested convex bodies nearly optimally
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2018
Closest in time.
A nearly-linear bound for chasing nested convex bodies
C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, and Yin Tat Lee · 2019
Closest in time.
Competitively chasing convex bodies
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…