A lower bound for the steiner tree problem in directed graphs (Q5753759): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230200606 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044506432 / rank | |||
Normal rank | |||
Revision as of 15:40, 19 March 2024
scientific article; zbMATH DE number 4189493
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the steiner tree problem in directed graphs |
scientific article; zbMATH DE number 4189493 |
Statements
A lower bound for the steiner tree problem in directed graphs (English)
0 references
1990
0 references
minimum Steiner tree problem
0 references
directed graphs
0 references
dual ascent algorithm
0 references
projection method
0 references
lower bound
0 references
