Gupta, A.; Könemann, J.; Leonardi, S.; Ravi, R.; Schäfer, G. An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. (English) Zbl 1302.90235 Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 1153-1162 (2007). Cited in 11 Documents MSC: 90C35 Programming involving graphs or networks 05C05 Trees 05C85 Graph algorithms (graph-theoretic aspects) 68Q25 Analysis of algorithms and problem complexity 90C27 Combinatorial optimization Citations:Zbl 1300.91038 PDFBibTeX XMLCite \textit{A. Gupta} et al., in: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7--9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 1153--1162 (2007; Zbl 1302.90235)