The edge-disjoing steiner problem in graphs (Q4893707)
From MaRDI portal
!
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 928052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The edge-disjoing steiner problem in graphs |
scientific article; zbMATH DE number 928052 |
Statements
The edge-disjoing steiner problem in graphs (English)
0 references
18 September 1996
0 references
reliability
0 references
Lagrange relaxation
0 references
Steiner problem in graphs
0 references
tree of minimum total weight
0 references
edge disjoint Steiner problem
0 references
NP-complete
0 references
upper bound generation
0 references
0.9316552
0 references
0.91877097
0 references
0.91209865
0 references
0 references
0 references
0.90759104
0 references
0.9063828
0 references
0 references
