Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications

Hung Nguyen, Phuc Thai, My Thai +2

Given a weighted hypergraph $\mathcal{H}(V,\mathcal{E}\subseteq 2^V,w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted cover…