On better heuristics for Steiner minimum trees (Q687085)
From MaRDI portal
!
WARNING
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 429121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On better heuristics for Steiner minimum trees |
scientific article; zbMATH DE number 429121 |
Statements
On better heuristics for Steiner minimum trees (English)
0 references
20 December 1993
0 references
approximation performance ratio
0 references
shortest network
0 references
Steiner minimum tree
0 references
polynomial-time heuristic
0 references
0.96030855
0 references
0.9327723
0 references
0.92967784
0 references
0.9239682
0 references
0.9235479
0 references
0.92156345
0 references
0.92110634
0 references
0.9190196
0 references
