Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (Q3638865)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs |
scientific article |
Statements
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (English)
0 references
28 October 2009
0 references
