An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125)
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: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space |
scientific article; zbMATH DE number 5358805
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space |
scientific article; zbMATH DE number 5358805 |
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
