The minimal hitting set generation problem: algorithms and computation

1 code implementation • 5 Jan 2016 • Andrew Gainer-Dewar, Paola 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.

General Classification