Approximating the Minimum Spanning Tree Weight in Sublinear Time (Q5317201)
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: Approximating the Minimum Spanning Tree Weight in Sublinear Time |
scientific article; zbMATH DE number 2205897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Minimum Spanning Tree Weight in Sublinear Time |
scientific article; zbMATH DE number 2205897 |
Statements
Approximating the Minimum Spanning Tree Weight in Sublinear Time (English)
0 references
16 September 2005
0 references
minimum spanning tree
0 references
sublinear time algorithms
0 references
randomized algorithms
0 references
approximation algorithms
0 references
0.9959867000579834
0 references
0.8951162099838257
0 references
0.890570878982544
0 references
0.8228395581245422
0 references
