Our main 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 BDD's and much different from our techniques. Numerical experiments show that traditional one-by-one enumeration schemes cannot compete against compressed enumeration when the degree of compression is high. Our method works particularly well in these two cases: Either compressing all e x a c t hitting sets, or all m i n i m u m - cardinality hitting sets. In many aspects this version is better structured than its predecessor, and also contains some new material (such as an application of Rado's Theorem).

翻译：我们的主要目标是基于通配符的压缩枚举，针对一般超图的所有最小击中集。据作者所知，先前唯一尝试压缩的研究由Toda提出，基于BDD，且与我们的技术截然不同。数值实验表明，当压缩度较高时，传统的逐一枚举方案无法与压缩枚举相抗衡。我们的方法在以下两种情况下特别有效：要么压缩所有精确击中集，要么压缩所有最小基数击中集。在许多方面，本版本比其前身结构更优，并且包含一些新内容（例如Rado定理的一个应用）。