Pages that link to "Item:Q3638045"
From MaRDI portal
The following pages link to Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (Q3638045):
Displaying 8 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
