10 citations · 17 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Unbounded lower bound for k-server against weak adversaries
Marcin Bienkowski, Jarosław Byrka, Christian Coester +1
We study the resource augmented version of the -server problem, also known as the -server problem against weak adversaries or the -server problem. In this setting, an…
cs.DS2019★ 10 cited
Pure entropic regularization for metrical task systems
Christian Coester, James R. Lee
We show that on every -point HST metric, there is a randomized online algorithm for metrical task systems (MTS) that is -competitive for service costs and -competi…