An SST-based algorithm for the steiner problem in graphs (Q3813625)
From MaRDI portal
!
WARNING
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 4083393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An SST-based algorithm for the steiner problem in graphs |
scientific article; zbMATH DE number 4083393 |
Statements
An SST-based algorithm for the steiner problem in graphs (English)
0 references
1989
0 references
Steiner problem
0 references
undirected graph
0 references
shortest spanning tree
0 references
additional constraints
0 references
lower bound
0 references
Lagrangean relaxation
0 references
0.9055142998695374
0 references
0.9018712639808656
0 references
0.8707420229911804
0 references
