How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793)
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: How to find Steiner minimal trees in Euclidean \(d\)-space |
scientific article; zbMATH DE number 37167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to find Steiner minimal trees in Euclidean \(d\)-space |
scientific article; zbMATH DE number 37167 |
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
