Enumerating all minimal hitting sets in polynomial total time
Abstract
Consider a hypergraph (=set system) H whose h hyperedges are subsets of a set with w elements. We show that the R minimal hitting sets of H can be enumerated in polynomial total time O(Rh2 w2).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.