Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q5283242)
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: Randomization Helps Computing a Minimum Spanning Tree under Uncertainty |
scientific article; zbMATH DE number 6750885
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomization Helps Computing a Minimum Spanning Tree under Uncertainty |
scientific article; zbMATH DE number 6750885 |
Statements
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (English)
0 references
21 July 2017
0 references
online algorithms
0 references
competitive analysis
0 references
minimum spanning tree
0 references
randomized algorithms
0 references
0.99999976
0 references
0.92310023
0 references
0.9155886
0 references
0.90904105
0 references
0 references
0 references
