The Densest k-Subhypergraph Problem

Eden Chlamtáč, Michael Dinitz, Christian Konrad +2

The Densest $k$-Subgraph (D$k$S) problem, and its corresponding minimization problem Smallest $p$-Edge Subgraph (S$p$ES), have come to play a central role in approximation algorith…