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

一种基于局部搜索的集合覆盖方法

A Local Search-Based Approach for Set Covering

Anupam Gupta, Euiwoong Lee, Jason Li

摘要:

在集合覆盖问题中,我们给出了一个集合系统,每个集合都有一个权重,我们希望找到一个覆盖整个宇宙的集合,同时具有较低的总权重。有几种已知的方法(基于贪婪方法、松弛和舍入以及双重拟合)实现了该问题的$H_k \approx \ln k + O(1)$近似,其中每个集合的大小由$k$限定。此外,得到$\ln k - O(\ln \ln k)$近似值是困难的。真相在哪里?我们能缩小上界和下界之间的差距吗?对于小的$k$值的改进将是特别有趣的,这通常用于集合覆盖和其他组合优化问题之间的约简。我们考虑一个非遗忘的本地搜索方法:据我们所知,这给出了第一个$H_k$ -近似集覆盖使用的方法基于本地搜索。我们的证明适合在一页,并给出了完整性差距的结果。通过考虑较大的移动和优化的势函数来改进我们的方法,给出了$(H_k - Ω(\log^2 k)/k)$近似,改进了基于修改的贪心算法的$(H_k - Ω(1/k^8))$(\emph{R.\ Hassin and A.\ Levin, SICOMP '05})的先前界。

英文摘要:

In the Set Cover problem, we are given a set system with each set having a weight, and we want to find a collection of sets that cover the universe, whilst having low total weight. There are several approaches known (based on greedy approaches, relax-and-round, and dual-fitting) that achieve a $H_k \approx \ln k + O(1)$ approximation for this problem, where the size of each set is bounded by $k$. Moreover, getting a $\ln k - O(\ln \ln k)$ approximation is hard. Where does the truth lie? Can we close the gap between the upper and lower bounds? An improvement would be particularly interesting for small values of $k$, which are often used in reductions between Set Cover and other combinatorial optimization problems. We consider a non-oblivious local-search approach: to the best of our knowledge this gives the first $H_k$-approximation for Set Cover using an approach based on local-search. Our proof fits in one page, and gives a integrality gap result as well. Refining our approach by considering larger moves and an optimized potential function gives an $(H_k - Ω(\log^2 k)/k)$-approximation, improving on the previous bound of $(H_k - Ω(1/k^8))$ (\emph{R.\ Hassin and A.\ Levin, SICOMP '05}) based on a modified greedy algorithm.

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

↑