Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling

Thomas Bläsius, Tobias Friedrich, Julius Lischeid +2

The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polyn…