Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344)
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 6028474
| 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 6028474 |
Statements
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (English)
0 references
26 April 2012
0 references
Steiner trees
0 references
packing
0 references
approximation algorithms
0 references
hardness of approximation
0 references
NP-hard
0 references
planar graphs
0 references
element connectivity
0 references
edge connectivity
0 references
partition connectivity
0 references
0 references
0 references
0.997917652130127
0 references
0.9152019619941713
0 references
0.9112488031387328
0 references
0.8995405435562134
0 references
0.8576037883758545
0 references
