An SST-based algorithm for the steiner problem in graphs (Q3813625): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230190102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134143366 / rank | |||
Normal rank | |||
Revision as of 19:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An SST-based algorithm for the steiner problem in graphs |
scientific article |
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
