Irving van Heuven van Staereling

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
  • 1