A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
From MaRDI portal
Publication:3603523
DOI10.1007/978-3-540-73951-7_14zbMATH Open1209.68650OpenAlexW2112839770MaRDI QIDQ3603523FDOQ3603523
Authors: Siamak Tazari, Matthias Müller-Hannemann 
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_14
Recommendations
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- An Approximation Scheme for Finding Steiner Trees with Obstacles
- An approximation scheme for some Steiner tree problems in the plane
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
- scientific article; zbMATH DE number 1555959
Cited In (10)
- An Approximation Scheme for Finding Steiner Trees with Obstacles
- An O ( n log n ) approximation scheme for Steiner tree in planar graphs
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- Title not available (Why is that?)
- Simplifying obstacles for Steiner network problems in the plane
- Dealing with large hidden constants: engineering a planar Steiner tree PTAS
- Dealing with large hidden constants, engineering a planar Steiner tree PTAS
- Rectilinear paths with minimum segment lengths
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
This page was built for publication: A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603523)
