A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
From MaRDI portal
Recommendations
- Node-weighted Steiner tree approximation in unit disk graphs
- Approximations for node-weighted Steiner tree in unit disk graphs
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Parameterized study of Steiner tree on unit disk graphs
- Parameterized Study of Steiner Tree on Unit Disk Graphs
- A strong lower bound for the Node Weighted Steiner Tree Problem
- An exact algorithm for the node weighted Steiner tree problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- The node-weighted steiner tree problem
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Cited in
(6)- Approximations for node-weighted Steiner tree in unit disk graphs
- On full Steiner trees in unit disk graphs
- Parameterized study of Steiner tree on unit disk graphs
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Node-weighted Steiner tree approximation in unit disk graphs
This page was built for publication: A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637048)