How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:14, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to find Steiner minimal trees in Euclidean \(d\)-space |
scientific article |
Statements
How to find Steiner minimal trees in Euclidean \(d\)-space (English)
0 references
28 June 1992
0 references
Steiner minimal trees
0 references
Euclidean \(d\)-space
0 references
subexponential algorithms
0 references
regular polytopes
0 references
Gilbert-Pollak conjecture
0 references
sensitivity diagrams
0 references
