The densest k-subhypergraph problem^∗

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 to their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed that they do not admit a subpolynomial approximation ratio (although the best-known hardness results do not rule this out). In this paper we generalize both DkS and SpES from graphs to hypergraphs. We consider the densest k-subhypergraph (DkSH) problem (given a hypergraph (V,E), find a subset W ⊆ V of k vertices so as to maximize the number of hyperedges contained in W), and define the minimum p-union (MpU) problem (given a hypergraph, choose p of the hyperedges so as to minimize the number of vertices in their union). We focus in particular on the case where all hyperedges have size 3, as this is the simplest nongraph setting. For this case we provide an O(n⁴⁽⁴⁻3)/13+) < O(n^0.697831+)-approximation (for arbitrary constant > 0) for DkSH and an Õ(n²/⁵)-approximation for MpU. We also give an O(m)-approximation for MpU in general hypergraphs. Finally, we examine the interesting special case of interval hypergraphs (instances where the vertices are a subset of the natural numbers and the hyperedges are intervals of the line) and prove that both problems admit an exact polynomial-time solution on these instances.