Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:describes |
k servers in a metric space must serve a sequence of requests
|
| gptkbp:field |
theoretical computer science
online algorithms |
| gptkbp:goal |
minimize total distance traveled by servers
|
| gptkbp:hasApplication |
caching
resource allocation network routing robot motion planning |
| gptkbp:hasKnownResult |
2-server problem is optimally solved by the work function algorithm
randomized algorithms can do better in some cases work function algorithm is k-competitive no deterministic algorithm is better than k-competitive |
| gptkbp:hasSpecialCase |
gptkb:2-server_problem
paging problem (k-server on uniform metric) |
| https://www.w3.org/2000/01/rdf-schema#label |
The k-Server Problem
|
| gptkbp:introduced |
gptkb:Robert_Tarjan
gptkb:Daniel_Sleator |
| gptkbp:introducedIn |
1985
|
| gptkbp:numberOfIssues |
gptkb:k-server_conjecture
|
| gptkbp:relatedTo |
gptkb:topology
competitive analysis paging problem |
| gptkbp:bfsParent |
gptkb:Yossi_Azar
|
| gptkbp:bfsLayer |
6
|