66 citations · 457 across the 33 of their papers we have counts for
1 paper · 2 filters
René van Bevern
d-Hitting Set is the NP-hard problem of selecting at most k vertices of a hypergraph so that each hyperedge, all of which have cardinality at most d, contains at least one selected…