超图中的强最大独立集问题的数据缩减
Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
AI总结:
本文提出九个数据缩减规则,用于超图中的强最大独立集问题,显著减少实例大小并提升求解效率。
摘要:
本文针对超图中的最大独立集问题进行了研究。虽然该问题在图上已有广泛研究,但我们关注其在超图中的强扩展形式,其中边可能连接任意数量的顶点。超图中的一组顶点若为强独立集,则每条边至多包含一个顶点。该问题的一个应用是寻找完美最小哈希函数。我们提出了九个专门为此问题设计的数据缩减规则。我们的缩减程序可以作为任何求解器的预处理步骤。我们分析了当结合此预处理步骤时,缩减实例大小和后续求解器性能的影响。我们的结果表明,实例大小显著减少,并且后续求解器的运行时间有所提高。预处理程序将实例大小平均缩减到原始大小的22%,耗时6.76秒。当将我们的缩减预处理与表现最佳的精确求解器结合时,我们观察到不使用缩减规则时的平均加速率为3.84倍。在某些情况下,我们能实现高达53倍的加速。此外,结合我们的预处理步骤后,一个额外的实例可以通过某种方法求解。
英文摘要:
This work addresses the well-known Maximum Independent Set problem in the context of hypergraphs. While this problem has been extensively studied on graphs, we focus on its strong extension to hypergraphs, where edges may connect any number of vertices. A set of vertices in a hypergraph is strongly independent if there is at most one vertex per edge in the set. One application for this problem is to find perfect minimal hash functions. We propose nine new data reduction rules specifically designed for this problem. Our reduction routine can serve as a preprocessing step for any solver. We analyze the impact on the size of the reduced instances and the performance of several subsequent solvers when combined with this preprocessing. Our results demonstrate a significant reduction in instance size and improvements in running time for subsequent solvers. The preprocessing routine reduces instances, on average, to 22% of their original size in 6.76 seconds. When combining our reduction preprocessing with the best-performing exact solver, we observe an average speedup of 3.84x over not using the reduction rules. In some cases, we can achieve speedups of up to 53x. Additionally, one more instance becomes solvable by a method when combined with our preprocessing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。