Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (Q3638865): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Joseph Cheriyan / rank | |||
| Property / author | |||
| Property / author: Joseph Cheriyan / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2142756199 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:41, 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
28 October 2009
0 references
