A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees (Q4575666): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/1.9781611974331.ch85 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4231737678 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:16, 20 March 2024
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
