Prize-Collecting Steiner Network Problems
From MaRDI portal
Publication:3569809
DOI10.1007/978-3-642-13036-6_6zbMath1285.90049OpenAlexW2167294598MaRDI QIDQ3569809
Rohit Khandekar, Zeev Nutov, Mohammad Taghi Hajiaghayi, Guy Kortsarz
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_6
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
On some network design problems with degree constraints, An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties, Approximation algorithm for the partial set multi-cover problem, Approximation algorithms for the submodular edge cover problem with submodular penalties
