1 citations · 2 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz
In the \emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph with nodes, a predefined node , two weights associated to each node modelling cost…
cs.DS2022
Budgeted Out-tree Maximization with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
We consider a variant of the prize collecting Steiner tree problem in which we are given a \emph{directed graph} , a monotone submodular prize function $p:2^V \rightarrow…