10 citations · 17 across the 14 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Online metric allocation
Nikhil Bansal, Christian Coester
We introduce a natural online allocation problem that connects several of the most fundamental problems in online optimization. Let be an -point metric space. Consider a res…
cs.DS2021
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
Antonios Antoniadis, Christian Coester, Marek Eliáš +2
We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between…
cs.DS2021
Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle
Christian Coester, Elias Koutsoupias
The -server conjecture, first posed by Manasse, McGeoch and Sleator in 1988, states that a -competitive deterministic algorithm for the -server problem exists. It is conje…