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.
2018
2018
This work presents the first algorithm for the problem of weighted online perfect bipartite matching with i.i.d. arrivals… 
Review
2018
Review
2018
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences… 
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… 
2009
2009
In this paper we consider multicriteria formulations of classical online problems in which an algorithm must simultaneously… 
2007
2007
We study a modification of the well known work function algorithm (WFA) for solving the on-line k-server problem. Our modified… 
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… 
2006
2006
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the… 
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…