collaborators

1 paper

cs.DS2025

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 , defined over a ground set , and a directed graph…