A fast and simple algorithm for computing approximate Euclidean minimum spanning trees (Q4575666)
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: A fast and simple algorithm for computing approximate Euclidean minimum spanning trees |
scientific article; zbMATH DE number 6903962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and simple algorithm for computing approximate Euclidean minimum spanning trees |
scientific article; zbMATH DE number 6903962 |
Statements
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees (English)
0 references
16 July 2018
0 references
approximation algorithms
0 references
Euclidean minimum spanning trees
0 references
well-separated pair decompositions
0 references
0.8574352860450745
0 references
0.8493779897689819
0 references
0.8428363800048828
0 references
