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 the normal view instead:
scientific article; zbMATH DE number 5358805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9055788516998292
0 references
0.8619919419288635
0 references
0.8563439249992371
0 references
0.8531481027603149
0 references
0.8461883068084717
0 references
