The Ground-Set-Cost Budgeted Maximum Coverage Problem


We study the following natural variant of the budgeted maximum coverage problem: We are given a budget B and a hypergraph G = (V,E), where each vertex has a non-negative cost and a non-negative profit. The goal is to select a set of hyperedges T ⊆ E such that the total cost of the vertices covered by T is at most B and the total profit of all covered… (More)
DOI: 10.4230/LIPIcs.MFCS.2016.50


2 Figures and Tables

Slides referencing similar topics