Algorithms for degree-constrained Euclidean Steiner minimal tree (Q3087683)
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: Algorithms for degree-constrained Euclidean Steiner minimal tree |
scientific article; zbMATH DE number 5939642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for degree-constrained Euclidean Steiner minimal tree |
scientific article; zbMATH DE number 5939642 |
Statements
Algorithms for degree-constrained Euclidean Steiner minimal tree (English)
0 references
16 August 2011
0 references
degree-constrained
0 references
Euclidean Steiner minimal tree
0 references
simulated annealing
0 references
ant algorithm
0 references
0.7972624897956848
0 references
0.7795466780662537
0 references
0.767913281917572
0 references
0.7633751630783081
0 references
