An Approximation Algorithm for the Connected Maximum Coverage Problem in Directed Graphs

Gianlorenzo D'Angelo, Esmaeil Delfaraz

In the Directed rooted Connected Budgeted maximum Coverage problem (\DRCC), we are given a collection of subsets $\mathcal{S}$, defined over a ground set $X$, and a directed graph…