The Densest k-Subhypergraph Problem
SIAM J. Discrete Math., Volume 32, Issue 2, 2018, Pages 1458-1477.
The Densest k-Subgraph (DkS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two pro...More
PPT (Upload PPT)