Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570)
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 Weight of the Euclidean Minimum Spanning Tree in Sublinear Time |
scientific article; zbMATH DE number 2220460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time |
scientific article; zbMATH DE number 2220460 |
Statements
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (English)
0 references
28 October 2005
0 references
sublinear algorithms
0 references
minimum spanning tree
0 references
0.9682021
0 references
0.94856185
0 references
0.94822705
0 references
0.92461896
0 references
0.92196894
0 references
0.92196894
0 references
0.91828346
0 references
