An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric (Q3910011)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric |
scientific article |
Statements
An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric (English)
0 references
1981
0 references
algorithm
0 references
decomposition
0 references
triangulation
0 references
Voronoi diagram
0 references
