2009
DOI: 10.1016/j.cosrev.2009.04.002
|View full text |Cite
|
Sign up to set email alerts
|

The -server problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
67
0
1

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 93 publications
(69 citation statements)
references
References 69 publications
0
67
0
1
Order By: Relevance
“…For weighted k-server problem, in which servers have different weights and the cost for a server to serve a request is equal to moving distance times its weight, Chrobak and Sgall [3] proved the work function algorithm was 5-competitive for 2-server in a uniform space, in which the distance between any two points is a unit. As referred to, since the k-server problem is critical and has long history, please see [5] for a detailed survey.…”
Section: B Related Work and Their Resultsmentioning
confidence: 99%
“…For weighted k-server problem, in which servers have different weights and the cost for a server to serve a request is equal to moving distance times its weight, Chrobak and Sgall [3] proved the work function algorithm was 5-competitive for 2-server in a uniform space, in which the distance between any two points is a unit. As referred to, since the k-server problem is critical and has long history, please see [5] for a detailed survey.…”
Section: B Related Work and Their Resultsmentioning
confidence: 99%
“…Subsequently, Chung et al [3] gave a polylogarithmic algorithm for the variant where the algorithm has one additional server at every point in the metric where there is at least one server. Another problem which resembles online matching is the k-server problem (see [9] for a survey). The main difference between the two problems is that in the k-server problem a server can be used to serve subsequent requests, while in the online matching problem a server has to be irrevocably matched to a request.…”
Section: Other Related Problemsmentioning
confidence: 99%
“…The k-server problem was introduced by Manasse, McGeoch, and Sleater [15]. A review of the k-server problem literature was written by Koutsoupias [13]. For randomized algorithms in discrete metrics, the competitive ratio O(log 2 (k) log (n)) was attained by Bubeck et.…”
Section: Related Workmentioning
confidence: 99%