Budgeted out-tree maximization with submodular prizes

DOI10.4230/LIPICS.ISAAC.2022.9MaRDI QIDQ6602425zbMATH OpenFDO

Authors Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.9

zbMATH Keywords

approximation algorithmsbudgeted problemdirected graphsprize collecting Steiner tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Approximation algorithms for node-weighted directed Steiner problems

This page was built for publication: Budgeted out-tree maximization with submodular prizes

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