Enumerating all minimal hitting sets in polynomial total time

arxiv（2023）

引用 0|浏览0

暂无评分

摘要

Consider a hypergraph (=set system) $\mathbb{H}$ whose $h$ hyperedges are subsets of a set with w elements. We show that the $R$ minimal hitting sets of $\mathbb{H}$ can be enumerated in polynomial total time $O(Rh^2 w^2)$.

查看译文

关键词

polynomial total time,sets

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要