The infinite server problem
We study a variant of the k-server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive analysis, we show a surprisingly tight connection between this proble...
Hlavní autoři: | Coester, C, Koutsoupias, E, Lazos, F |
---|---|
Médium: | Conference item |
Vydáno: |
Schloss Dagstuhl
2017
|
Podobné jednotky
-
The infinite server problem
Autor: Coester, C, a další
Vydáno: (2021) -
Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
Autor: Coester, C, a další
Vydáno: (2021) -
The k−server problem
Autor: Koutsoupias, E
Vydáno: (2009) -
Weak adversaries for the k−server problem
Autor: Koutsoupias, E
Vydáno: (2015) -
The online 𝑘-taxi problem
Autor: Coester, C, a další
Vydáno: (2019)