The Ground-Set-Cost Budgeted Maximum Coverage Problem
{{output}}
We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph [Formula: see text], where each vertex has a non-negative cost and a non-negative profit. The goal is to select a set of hyperedges [Formu... ...