2 citations · 8 across the 13 of their papers we have counts for
1 paper · 1 filter
Dekel Tsur
In the 3-Hitting Set problem, the input is a hypergraph G such that the size of every hyperedge of G is at most 3, and an integers k, and the goal is to decide whether there…