Minimum Latency Submodular Cover
Minimum Latency Submodular Cover
We study the Minimum Latency Submodular Cover (MLSC) problem, which consists of a metric ( V , d ) with source r ∈ V and m monotone submodular functions f 1 , f 2 , …, f m : 2 V → [0, 1]. The goal is to find a …