An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989550031 / rank | |||
Normal rank | |||
Revision as of 20:46, 19 March 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
