Hardness and approximation results for packing Steiner trees (Q2369873)
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: Hardness and approximation results for packing Steiner trees |
scientific article; zbMATH DE number 5166168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and approximation results for packing Steiner trees |
scientific article; zbMATH DE number 5166168 |
Statements
Hardness and approximation results for packing Steiner trees (English)
0 references
21 June 2007
0 references
packing edge-disjoint Steiner trees of undirected graphs
0 references
packing Steiner-node-disjoint Steiner trees of undirected graphs
0 references
0 references
0.9479527
0 references
0.9479527
0 references
0 references
0 references
0.9358069
0 references
0 references
