Skip to search formSkip to main contentSkip to account menu

K-server problem

The k-server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper we consider a generalized k-server problem with parallel requests where several servers can also be located on one… 
2013
2013
We show how to restrict the analysis of a class of online problems that includes the $k$-server problem in finite metrics such… 
2010
2010
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In… 
2010
2010
In this article we consider multicriteria formulations of classical online problems in which an algorithm must simultaneously… 
2010
2010
We consider a stochastic version of the $k$-server problem in which $k$ servers move on a circle to satisfy stochastically… 
2007
2007
The online k-server problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which… 
2005
2005
We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a… 
Review
2005
Review
2005
The k-server problem, introduced by Manasse, McGeoch and Sleator [29, 30] is a fundamental online problem where k mobile servers… 
Review
1997
Review
1997
We survey the research performed during the last few years on the on-line $k$-server problem over metric spaces. A variety of… 
1992
1992
The authors consider the k-server problem in a distributed setting. Given a network of n processors, and k identical mobile…