@InProceedings{dangelo_et_al:LIPIcs.ISAAC.2022.9,
author = {D'Angelo, Gianlorenzo and Delfaraz, Esmaeil and Gilbert, Hugo},
title = {{Budgeted Out-Tree Maximization with Submodular Prizes}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.9},
URN = {urn:nbn:de:0030-drops-172945},
doi = {10.4230/LIPIcs.ISAAC.2022.9},
annote = {Keywords: Prize Collecting Steiner Tree, Directed graphs, Approximation Algorithms, Budgeted Problem}
}