22 citations · 55 across the 17 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
Better Bounds for Online Line Chasing
Marcin Bienkowski, Jarosław Byrka, Marek Chrobak +3
We study online competitive algorithms for the \emph{line chasing problem} in Euclidean spaces , where the input consists of an initial point and a sequence of line…
cs.DS2018★ 1 cited
The Online -Taxi Problem
Christian Coester, Elias Koutsoupias
We consider the online -taxi problem, a generalization of the -server problem, in which taxis serve a sequence of requests in a metric space. A request consists of two po…