The Densest k-Subhypergraph Problem

SIAM J. Discrete Math., Volume 32, Issue 2, 2018, Pages 1458-1477.

Cited by: 7|Bibtex|Views12|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments