10 citations · 17 across the 14 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
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…
cs.FL2018★ 1 cited
Streaming Rewriting Games: Winning Strategies and Complexity
Christian Coester, Thomas Schwentick, Martin Schuster
Context-free games on strings are two-player rewriting games based on a set of production rules and a regular target language. In each round, the first player selects a position of…