Steiner's problem in graphs: Heuristic methods (Q1201819): Difference between revisions
From MaRDI portal
Latest revision as of 14:12, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steiner's problem in graphs: Heuristic methods |
scientific article |
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
