The Densest $k$-Subhypergraph Problem
SIAM Journal on Discrete Mathematics, pp. 1458-1477, 2018.
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 algorithms. This is due both to their practical importance and to their usefulness as a tool for solving and establishing approximation bounds for other problems. These t...More
Full Text (Upload PDF)
PPT (Upload PPT)