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)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Michele Flammini, Gaia Nicosia
- ACM Trans. Algorithms
- 2010

In this article we consider multicriteria formulations of classical online problems in which an algorithm must simultaneouslyâ€¦Â (More)

Is this relevant?

Review

2009

Review

2009

- Elias Koutsoupias
- Computer Science Review
- 2009

The k-server problem is perhaps the most influential online problem: natural, crisp, with a surprising technical depth thatâ€¦Â (More)

Is this relevant?

Review

2005

Review

2005

- Duru TÃ¼rkoglu
- 2005

The k-server problem, introduced by Manasse, McGeoch and Sleator [29, 30] is a fundamental online problem where k mobile serversâ€¦Â (More)

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

- M.L.L. Junior, A. D. Doria Neto, J. Lemos de Melo
- Proceedings. 2005 IEEE International Jointâ€¦
- 2005

This work presents an original algorithm, based on reinforcement learning, as a solution for the k-server problem. This problemâ€¦Â (More)

Is this relevant?

1999

1999

- Elias Koutsoupias
- FOCS
- 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)

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

- Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
- On-Line Algorithms
- 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

- Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
- J. Algorithms
- 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

- Marek Chrobak, Howard J. Karloff, Thomas H. Payne, Sundar Vishwanathan
- SIAM J. Discrete Math.
- 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?