Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (Q3638865)
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: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs |
scientific article; zbMATH DE number 5622247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs |
scientific article; zbMATH DE number 5622247 |
Statements
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (English)
0 references
28 October 2009
0 references
0.997917652130127
0 references
0.9135156273841858
0 references
0.9102876782417296
0 references
0.901278018951416
0 references
0.8541536927223206
0 references
