A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees (Q4575666)
From MaRDI portal
scientific article; zbMATH DE number 6903962
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
