Steiner's problem in graphs: Heuristic methods (Q1201819)
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: Steiner's problem in graphs: Heuristic methods |
scientific article; zbMATH DE number 98509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steiner's problem in graphs: Heuristic methods |
scientific article; zbMATH DE number 98509 |
Statements
Steiner's problem in graphs: Heuristic methods (English)
0 references
17 January 1993
0 references
Heuristics for solving the Steiner problem on graphs are discussed. Implementations for an extensive collection of heuristics are used to examine their behaviour on random graphs, euclidean graphs and grid graphs. A substantial summary of the computational results is given.
0 references
Steiner tree
0 references
approximation algorithm
0 references
experimental comparison
0 references
0 references
0.9833133
0 references
0.9717078
0 references
0.93289983
0 references
0.9291398
0 references
