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...
Hoofdauteurs: | Coester, C, Koutsoupias, E, Lazos, F |
---|---|
Formaat: | Conference item |
Gepubliceerd in: |
Schloss Dagstuhl
2017
|
Gelijkaardige items
-
The infinite server problem
door: Coester, C, et al.
Gepubliceerd in: (2021) -
Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
door: Coester, C, et al.
Gepubliceerd in: (2021) -
The k−server problem
door: Koutsoupias, E
Gepubliceerd in: (2009) -
Weak adversaries for the k−server problem
door: Koutsoupias, E
Gepubliceerd in: (2015) -
The online 𝑘-taxi problem
door: Coester, C, et al.
Gepubliceerd in: (2019)