An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> (Q4894866): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5835066 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Problem of Steiner / rank | |||
Normal rank | |||
Latest revision as of 14:42, 24 May 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
0 references
