An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> (Q4894866): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230260411 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149509209 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 March 2024
scientific article; zbMATH DE number 932507
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
