Prize-Collecting Steiner Networks via Iterative Rounding

DOI10.1007/978-3-642-12200-2_45zbMath1283.68403OpenAlexW1522859394MaRDI 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

On some network design problems with degree constraints ⋮ On the Integrality Gap of the Prize-Collecting Steiner Forest LP ⋮ Approximation algorithms for prize-collecting capacitated network design problems ⋮ Euclidean prize-collecting Steiner forest ⋮ Network-Design with Degree Constraints

This page was built for publication: Prize-Collecting Steiner Networks via Iterative Rounding