Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
From MaRDI portal
Publication:5386209
DOI10.1137/S0097539702420474zbMath1137.68063OpenAlexW1967641001MaRDI QIDQ5386209
Publication date: 22 April 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539702420474
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
An approximation algorithm for maximum weight budgeted connected set cover, Optimal relay node placement in delay constrained wireless sensor network design, Some Steiner concepts on lexicographic products of graphs, Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems, A simple approximation algorithm for minimum weight partial connected set cover, Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem, A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death, Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs, Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Spider Covering Algorithms for Network Design Problems, Approximating node-weighted \(k\)-MST on planar graphs, Steiner intervals, geodesic intervals, and betweenness
