71 citations · 106 across the 18 of their papers we have counts for
1 paper · 1 filter
Sander Aarts, David B. Shmoys
The hitting set problem is a well-known NP-hard optimization problem in which, given a set of elements and a collection of subsets, the goal is to find the smallest selection of el…