Heuristics for the Steiner problem in graphs (Q1199447)
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: Heuristics for the Steiner problem in graphs |
scientific article; zbMATH DE number 94326
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the Steiner problem in graphs |
scientific article; zbMATH DE number 94326 |
Statements
Heuristics for the Steiner problem in graphs (English)
0 references
16 January 1993
0 references
spanning tree heuristic
0 references
contraction heuristic
0 references
average distance heuristic
0 references
path heuristic
0 references
Steiner problem in graphs
0 references
minimum cost tree
0 references
worst-case performance
0 references
