# The minimal hitting set generation problem: algorithms and computation

5 Jan 2016Andrew Gainer-DewarPaola Vera-Licona

Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic literature focuses on the problem of *recognizing* the collection of minimal hitting sets; however, in many of the applications, it is more important to *generate* these hitting sets... (read more)

PDF Abstract