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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
051019902017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In this article we consider multicriteria formulations of classical online problems in which an algorithm must simultaneously… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Review
2009
Review
2009
The k-server problem is perhaps the most influential online problem: natural, crisp, with a surprising technical depth that… (More)
  • figure 1
  • figure 2
Is this relevant?
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… (More)
  • figure 1
  • figure 2
Is this relevant?
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… (More)
Is this relevant?
2005
2005
This work presents an original algorithm, based on reinforcement learning, as a solution for the k-server problem. This problem… (More)
  • figure 1
  • figure 2
  • table 11
  • table III
Is this relevant?
1999
1999
We study the -server problem when the off-line algorithm has fewer than servers. We give two upper bounds of the cost WFA of the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper investigates a zero-sum game played on a weighted connected graph G between two players, the tree player and the edge… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph under a sequence of requests… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In the k-server problem, we must choose how k mobile servers will serve each of a sequence of requests, making our decisions in… (More)
Is this relevant?