Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems

Richard Taylor

For any given $\epsilon >0$ we provide an algorithm for the Densest $k$-Subhypergraph Problem with an approximation ratio of at most $O(n^{{\theta }_m+2\epsilon })$ for $θ_m=\frac{1}{2}m-\frac{1}{2}-\frac…