Prize-Collecting Steiner Networks via Iterative Rounding
From MaRDI portal
Publication:3557046
DOI10.1007/978-3-642-12200-2_45zbMath1283.68403MaRDI QIDQ3557046
Arefeh A. Nasri, Mohammad Taghi Hajiaghayi
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_45
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
On some network design problems with degree constraints, Euclidean prize-collecting Steiner forest, Network-Design with Degree Constraints