Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon (Q3603533)
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: Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon |
scientific article; zbMATH DE number 5508807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon |
scientific article; zbMATH DE number 5508807 |
Statements
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon (English)
0 references
17 February 2009
0 references
0.8486279249191284
0 references
0.8480339646339417
0 references
0.8475198745727539
0 references
0.838948667049408
0 references
0.8380997180938721
0 references
