Enumerating all minimal hitting sets in polynomial total time

03/14/2023

∙

by   Marcel Wild, et al.

∙

0

∙

share

Consider a hypergraph (=set system) ℍ whose h hyperedges are subsets of a set with w elements. We show that the R minimal hitting sets of ℍ can be enumerated in polynomial total time O(Rh^2 w^2).