Improved approximation algorithm for the Dense-3-Subhypergraph Problem

arXiv: Data Structures and Algorithms, Volume abs/1704.08620, 2017.

Cited by: 0|Bibtex|Views8|Links
EI

Abstract:

study of Dense-$3$-Subhypergraph problem was initiated in Chlamt{u0027{a}}c et al. [Approxu002716]. input is a universe $U$ and collection ${cal S}$ of subsets of $U$, each of size $3$, and a number $k$. goal is to choose a set $W$ of $k$ elements from the universe, and maximize the number of sets, $Sin {cal S}$ so that $Ssubseteq W$. ...More

Code:

Data:

Your rating :
0

 

Tags
Comments