arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.03152cs.DS
收藏

为动态贪心集合覆盖问题设计算法

Engineering Algorithms for Dynamic Greedy Set Cover

Tel Aviv University(特拉维夫大学)

Amitai Uzrad

AI总结:

本文通过实验证明四种贪心动态算法在实际应用中的性能,分析了参数β对质量与效率的平衡影响。

摘要:

在动态集合覆盖问题中,输入是一个动态的元素集和一个固定的集合集合。随着元素的插入或删除,目标是高效地维护近似最小集合覆盖。尽管过去十年在该问题上取得了显著的理论突破,但理论设计与实际性能之间仍存在明显差距,因为目前没有全面的实验研究来验证这些结果。在本文中,我们通过在多种现实世界实例上实现和评估四种贪心动态算法来填补这一差距。我们的实现基于最先进的框架(如GKKP、STOC 2017;SU、STOC 2023;SUZ、FOCS 2024),我们通过识别并修改复杂的子程序来简化这些框架,这些子程序优化了渐近界限但阻碍了实际性能。我们根据解决方案质量(集合覆盖大小)和效率(更新时间(每次插入或删除后更新解决方案所需的时间)和回退(每次更新中对解决方案所做的更改数量))来评估这些算法。每个算法使用参数β来平衡质量和效率;我们研究了该权衡参数对每个算法的影响,然后进行比较分析以评估这些算法之间的性能。我们的结果提供了首次实际见解,揭示了在现实场景中哪些算法策略最具价值。

英文摘要:

In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently maintain an approximate minimum set cover. While the past decade has seen significant theoretical breakthroughs for this problem, a notable gap remains between theoretical design and practical performance, as no comprehensive experimental study currently exists to validate these results. In this paper, we bridge this gap by implementing and evaluating four greedy-based dynamic algorithms across a diverse range of real-world instances. We derive our implementations from state-of-the-art frameworks (such as GKKP, STOC 2017; SU, STOC 2023; SUZ, FOCS 2024), which we simplify by identifying and modifying intricate subroutines that optimize asymptotic bounds but hinder practical performance. We evaluate these algorithms based on solution quality (set cover size) and efficiency, which comprises update time (the time required to update the solution following each insertion or deletion) and recourse (the number of changes made to the solution per update). Each algorithm uses a parameter $β$ to balance quality against efficiency; we investigate the influence of this tradeoff parameter on each algorithm and then perform a comparative analysis to evaluate the algorithms against each other. Our results provide the first practical insights into which algorithmic strategies provide the most value in realistic scenarios.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑