\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation (Q4575823)
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: O(depth)-competitive algorithm for online multi-level aggregation |
scientific article; zbMATH DE number 6904108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation |
scientific article; zbMATH DE number 6904108 |
Statements
<i>O</i>(depth)-Competitive Algorithm for Online Multi-level Aggregation (English)
0 references
16 July 2018
0 references
aggregation of requests
0 references
competitive analysis
0 references
online algorithms
0 references
0.9305530786514282
0 references
0.9217321872711182
0 references
0.869678795337677
0 references
0.8290084004402161
0 references
0.7537893652915955
0 references
