A heuristic for the Steiner problem in graphs (Q1918915)
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: A heuristic for the Steiner problem in graphs |
scientific article; zbMATH DE number 907958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the Steiner problem in graphs |
scientific article; zbMATH DE number 907958 |
Statements
A heuristic for the Steiner problem in graphs (English)
0 references
23 July 1996
0 references
heuristic
0 references
Steiner problem in graphs
0 references
minimum spanning tree
0 references
0 references
0.9717078
0 references
0.9560862
0 references
0.9423767
0 references
0.93276495
0 references
0.9312931
0 references
0.93090594
0 references
