使用通配符压缩：所有精确或所有最小命中集
Compression with wildcards: All exact, or all minimal hitting sets
摘要：
我们的主要目标是COMPRESSED枚举（基于通配符）的所有最小碰一般超图集。据作者所知，Toda以前唯一的压缩尝试是基于BDD的，与我们的技术大不相同。数值实验表明，当压缩程度较高时，传统的逐个枚举方案无法与压缩枚举方案竞争。我们的方法在这两种情况下特别有效：要么压缩所有的e x ac t命中集，要么压缩所有的m i n i m -基数命中集。在许多方面，这个版本比它的前身结构更好，也包含一些新的材料（如雷达定理的应用）。
英文摘要：
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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
