Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:47, 10 July 2024
scientific article; zbMATH DE number 7751508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the 2-competitiveness barrier for two servers in a tree |
scientific article; zbMATH DE number 7751508 |
Statements
Breaking the 2-competitiveness barrier for two servers in a tree (English)
0 references
17 October 2023
0 references
online algorithms
0 references
randomized algorithms
0 references
tree metric spaces
0 references
server problem
0 references
T-theory
0 references
game theory
0 references
