Enumeration of Minimal Hitting Sets Parameterized by Treewidth

Enumerating the minimal hitting sets of a hypergraph is a problem that arises in various data management applications, such as constraint mining, identifying unique column combinations, and generating database repairs. In this work, we present an enumeration algorithm with a delay that scales linearly with both the size of the input hypergraph and its treewidth,
following a single-exponential FPT preprocessing phase. The memory consumption of our algorithm is also single-exponential with respect to the treewidth of the hypergraph.