An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125): Difference between revisions
From MaRDI portal
Latest revision as of 09:37, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space |
scientific article |
Statements
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (English)
0 references
29 October 2008
0 references
Euclidean Steiner problem
0 references
strong branching
0 references
0 references
0 references
0 references