Euclidean Prize-Collecting Steiner Forest
From MaRDI portal
Publication:3557044
DOI10.1007/978-3-642-12200-2_44zbMath1283.68402OpenAlexW2492923247MaRDI QIDQ3557044
MohammadHossein Bateni, 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_44
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Euclidean Prize-Collecting Steiner Forest
