A New Algorithm for the Transversal Hypergraph Problem


The Transversal Hypergraph Problem is the problem of generating, given a hyper-graph, the set of its transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various elds of Computer Science. In this paper we present and experimentally evaluate a new heuristic algorithm for the… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics