Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
From MaRDI portal
Publication:3638045
DOI10.1007/978-3-642-02927-1_28zbMath1248.68556OpenAlexW1521628414MaRDI QIDQ3638045
Erik D. Demaine, Philip N. Klein, Mohammad Taghi Hajiaghayi
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/62256
Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Optimal relay node placement in delay constrained wireless sensor network design ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Approximation algorithms for priority Steiner tree problems ⋮ A PTAS for the Steiner Forest Problem in Doubling Metrics ⋮ Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs ⋮ Online Node-weighted Steiner Forest and Extensions via Disk Paintings ⋮ Computing a tree having a small vertex cover ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
This page was built for publication: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
