A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
From MaRDI portal
Publication:3603523
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)- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
- An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs
- An Approximation Scheme for Finding Steiner Trees with Obstacles
- Dealing with large hidden constants, engineering a planar Steiner tree PTAS
- Rectilinear paths with minimum segment lengths
- scientific article; zbMATH DE number 1985307 (Why is no real title available?)
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
- Simplifying obstacles for Steiner network problems in the plane
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- Dealing with large hidden constants: engineering a planar Steiner tree PTAS
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)