Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9540-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2180689556 / rank | |||
Normal rank | |||
Revision as of 20:56, 19 March 2024
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
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
