How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01758756 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088967712 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 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
