在多项式总时间下枚举所有极小碰集
组合数学
2024-12-06 v2 数据结构与算法
摘要
考虑一个超图（=集合系统），其 条超边是含 个元素的集合的子集。我们证明 的 个极小碰集可在多项式总时间 内枚举。
引用
@article{arxiv.2303.07708,
title = {Enumerating all minimal hitting sets in polynomial total time},
author = {Marcel Wild},
journal= {arXiv preprint arXiv:2303.07708},
year = {2024}
}
备注
There is a mistake in Case 1 of claim (4), which annihilates the proof of polynomial total time. This was pointed out independently by Arnaud Mary, then Endre Boros, then Martin Schirnek. My apologies for waiting so long with the withdrawal