Euclidean Prize-Collecting Steiner Forest

DOI10.1007/978-3-642-12200-2_44MaRDI QIDQ3557044zbMATH OpenOpenAlexFDO

Authors MohammadHossein Bateni, Mohammad T. 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Euclidean prize-collecting Steiner forest
• Solving the prize‐collecting Euclidean Steiner tree problem
• On the integrality gap of the prize-collecting Steiner forest LP
• Colored Non-crossing Euclidean Steiner Forest
• The Steiner forest problem revisited
• scientific article; zbMATH DE number 1445375
• On the Exact Solution of Prize-Collecting Steiner Tree Problems
• scientific article; zbMATH DE number 6783450

Cited in

(4)

• Streaming algorithms for geometric Steiner forest
• A PTAS for the Steiner forest problem in doubling metrics
• Colored Non-crossing Euclidean Steiner Forest
• Euclidean prize-collecting Steiner forest

This page was built for publication: Euclidean Prize-Collecting Steiner Forest

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557044)