The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal 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. We present and experimentally evaluate a heuristic algorithm for the problem, which seems able to handle large instances and also possesses some nice features especially desirable in problems with large output such as the Transversal Hypergraph Problem.
CITATION STYLE
Kavvadias, D. J., & Stavropoulos, E. C. (1999). Evaluation of an algorithm for the transversal hypergraph problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1668, p. 72). Springer Verlag. https://doi.org/10.1007/3-540-48318-7_8
Mendeley helps you to discover research relevant for your work.