Highly Influenced

# Exact algorithms for finding minimum transversals in rank-3 hypergraphs

@article{Wahlstrm2004ExactAF, title={Exact algorithms for finding minimum transversals in rank-3 hypergraphs}, author={Magnus Wahlstr{\"o}m}, journal={J. Algorithms}, year={2004}, volume={51}, pages={107-121} }

- Published 2004 in J. Algorithms
DOI:10.1016/j.jalgor.2004.01.001

We present two algorithms for the problem of nding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem is a natural extension of the vertex cover problem for ordinary graphs. The rst algorithm runs in time O(1:6538 n) for a hypergraph with n vertices, and needs polynomial space. The second algorithm uses exponential space and runs in time O(1:6316 n).