An Optimal On-Line Algorithm for <i>K</i> Servers on Trees (Q3204037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal On-Line Algorithm for K Servers on Trees |
scientific article; zbMATH DE number 4180792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal On-Line Algorithm for <i>K</i> Servers on Trees |
scientific article; zbMATH DE number 4180792 |
Statements
An Optimal On-Line Algorithm for <i>K</i> Servers on Trees (English)
0 references
1991
0 references
on-line algorithm
0 references
trees
0 references
the server problem
0 references
competitive analysis
0 references
metric space
0 references
0.9632398
0 references
0.9141001
0 references
0.8945937
0 references
0.8945937
0 references
0.8917094
0 references
0.8874313
0 references
0.8874313
0 references
0.8775419
0 references
0.87583566
0 references
