arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.03583cs.DScs.DM
收藏

拟阵约束下子模最大化问题的确定性算法与更快速算法

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint

Tel Aviv University(特拉维夫大学);University of Haifa(海法大学)

Niv Buchbinder, Moran Feldman

AI总结:

本文研究拟阵约束下单调子模最大化问题,提出了一种近似保证为 $1 - 1/e - \varepsilon$ 的确定性非盲目局部搜索算法,消除了与随机算法间的近似差距,并利用随机化将查询复杂度降至 $\tilde{O}_\varepsilon(n + r\sqrt{n})$。

摘要:

我们研究了在拟阵约束下最大化单调子模函数的问题,并为此提出了一种确定性非盲目局部搜索算法。该算法的近似保证为 $1 - 1/e - \varepsilon$(对于任意 $\varepsilon > 0$),查询复杂度为 $\tilde{O}_\varepsilon(nr)$,其中 $n$ 为基础集合的大小,$r$ 为拟阵的秩。我们的算法大幅改进了先前最先进的 $0.5008$ 近似确定性算法,并且实际上表明,在所考虑的问题中,确定性算法与随机算法所能获得的近似保证之间不存在差距。使用随机化方法,我们算法的查询复杂度可改进至 $\tilde{O}_\varepsilon(n + r\sqrt{n})$,这在 $r = O(\sqrt{n})$ 时是近似线性的,且始终至少与先前最先进的算法一样好。

英文摘要:

We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$ (for any $\varepsilon > 0$) and query complexity of $\tilde{O}_\varepsilon(nr)$, where $n$ is the size of the ground set and $r$ is the rank of the matroid. Our algorithm vastly improves over the previous state-of-the-art $0.5008$-approximation deterministic algorithm, and in fact, shows that there is no separation between the approximation guarantees that can be obtained by deterministic and randomized algorithms for the problem considered. The query complexity of our algorithm can be improved to $\tilde{O}_\varepsilon(n + r\sqrt{n})$ using randomization, which is nearly-linear for $r = O(\sqrt{n})$, and is always at least as good as the previous state-of-the-art algorithms.

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

↑