A heuristic for Euclidean and rectilinear Steiner problems (Q1194744)
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 68479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for Euclidean and rectilinear Steiner problems |
scientific article; zbMATH DE number 68479 |
Statements
A heuristic for Euclidean and rectilinear Steiner problems (English)
0 references
6 October 1992
0 references
heuristic
0 references
rectilinear Steiner problems
0 references
connected subgraphs
0 references
minimal spanning tree
0 references
0.8857606053352356
0 references
0.8766968250274658
0 references
0.8703275322914124
0 references
0.8639456629753113
0 references
