The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees (Q4575805)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6904093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees |
scientific article; zbMATH DE number 6904093 |
Statements
The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees (English)
0 references
16 July 2018
0 references
0.99999976
0 references
0.8874313
0 references
0.8804338
0 references
0 references
0.86129844
0 references
0 references
0 references
