A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141)
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: A better lower bound on the competitive ratio of the randomized 2-server problem |
scientific article; zbMATH DE number 6585446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better lower bound on the competitive ratio of the randomized 2-server problem |
scientific article; zbMATH DE number 6585446 |
Statements
A better lower bound on the competitive ratio of the randomized 2-server problem (English)
0 references
26 May 2016
0 references
online algorithms
0 references
randomized algorithms
0 references
competitive analysis
0 references
0.8821709752082825
0 references
0.880318820476532
0 references
0.8349608778953552
0 references
0.8345906734466553
0 references
0.8345906734466553
0 references
