Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems

DOI10.1007/978-3-642-39206-1_8zbMath1336.68288arXiv1304.7530OpenAlexW1497634048MaRDI QIDQ5326552

MohammadHossein Bateni, Vahid Liaghat, Mohammad Taghi Hajiaghayi

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7530

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

An approximation algorithm for maximum weight budgeted connected set cover ⋮ A simple approximation algorithm for minimum weight partial connected set cover ⋮ Covering problems in edge- and node-weighted graphs ⋮ Spider Covering Algorithms for Network Design Problems ⋮ Approximating node-weighted \(k\)-MST on planar graphs ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems

This page was built for publication: Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems