A lower bound for the steiner tree problem in directed graphs (Q5753759)
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: Publication:5753759 |
scientific article; zbMATH DE number 4189493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8805626630783081
0 references
0.8798511028289795
0 references
0.8424196839332581
0 references
0.8364753127098083
0 references
