Affiliation:
1. Department of Mathematical Sciences, University of Stellenbosch, Private Bag X1 , Matieland 7602 , South Africa
Abstract
Abstract
Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much different from our techniques. Traditional one-by-one enumeration schemes cannot compete when the number of minimal hitting sets is large and the degree of compression is high. Our method works particularly well in these two cases: either compressing all minimum cardinality hitting sets, or compressing all exact hitting sets.
Reference15 articles.
1. A. Gainer-Dewar and P. Vera-Licona, The minimal hitting set generation problem: algorithms and computation, SIAM J. Discrete Math. 31 (2017), no. 1, 63–100.
2. M. Hagen, Algorithmic and computational complexity issues of MONET, PhD thesis, Friedrich-Schiller-Universiät, Jena, 2008.
3. T. Toda, Hypergraph transversal computation with binary decision diagrams, in: V. Bonifaci, C. Demetrescu, and A. Marchetti-Spaccamela (Eds.), Experimental Algorithms. SEA 2013, Lecture Notes in Computer Science, Vol. 7933, Springer, Berlin, 2013.
4. M. Wild, Counting or producing all fixed cardinality transversals, Algorithmica 69 (2014), no. 1, 117–129.
5. K. Murakami and T. Uno, Efficient algorithms for dualizing large-scale hypergraphs, Discrete Appl. Math. 170 (2014), 83–94.