An Efficient Branch-and-Bound Solver for Hitting Set

Thomas Bläsius, Tobias Friedrich, David Stangl +1

The hitting set problem asks for a collection of sets over a universe $U$ to find a minimum subset of $U$ that intersects each of the given sets. It is NP-hard and equivalent to th…