An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> (Q4894866)
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: An O(N2) heuristic for steiner minimal trees in E3 |
scientific article; zbMATH DE number 932507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> |
scientific article; zbMATH DE number 932507 |
Statements
An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> (English)
0 references
13 November 1996
0 references
Steiner minimal trees
0 references
heuristic algorithms
0 references
Delaunay triangulation in 3-space
0 references
0 references
0.8659730553627014
0 references
0.8368940949440002
0 references
0.8308393359184265
0 references
