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

次线性时间内的集合覆盖

Set Cover in Sub-linear Time

Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee

摘要:

从次线性算法的角度研究了经典的集合覆盖问题。给定访问集合的$m$集在查询模型中的$n$元素,我们表明,从现有技术中得到的次线性算法几乎紧密的查询复杂性。一方面,首先我们展示了Har-Peled等人提出的流算法的适应。[2016]到次线性查询模型,使用$\tilde{O}(m(n/k)^{1/(α-1)} + nk)$查询返回$α$近似覆盖到输入,其中$k$表示最小集覆盖的值。然后,我们补充这个上限证明,较低的$k$值,所需的查询数量是$\tildeΩ(m(n/k)^{1/(2α)})$,即使是估计最佳的覆盖大小。此外,我们证明,即使检查一个给定的集合是否涵盖了所有的元素将需要$Ω(nk)$查询。这两个下限提供了强有力的证据,上限几乎是紧的参数$k$的某些值。另一方面,我们表明,这个界限是不是最佳的参数$k$的较大值,因为存在一个$(1+\varepsilon)$近似算法与$\tilde{O}(mn/k\varepsilon^2)$查询。我们表明,这个界限是足够小的常数$\varepsilon$基本上是紧的,通过建立一个下限的$\tildeΩ(mn/k)$查询复杂性。

英文摘要:

We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of $m$ sets over $n$ elements in the query model, we show that sub-linear algorithms derived from existing techniques have almost tight query complexities. On one hand, first we show an adaptation of the streaming algorithm presented in Har-Peled et al. [2016] to the sub-linear query model, that returns an $α$-approximate cover using $\tilde{O}(m(n/k)^{1/(α-1)} + nk)$ queries to the input, where $k$ denotes the value of a minimum set cover. We then complement this upper bound by proving that for lower values of $k$, the required number of queries is $\tildeΩ(m(n/k)^{1/(2α)})$, even for estimating the optimal cover size. Moreover, we prove that even checking whether a given collection of sets covers all the elements would require $Ω(nk)$ queries. These two lower bounds provide strong evidence that the upper bound is almost tight for certain values of the parameter $k$. On the other hand, we show that this bound is not optimal for larger values of the parameter $k$, as there exists a $(1+\varepsilon)$-approximation algorithm with $\tilde{O}(mn/k\varepsilon^2)$ queries. We show that this bound is essentially tight for sufficiently small constant $\varepsilon$, by establishing a lower bound of $\tildeΩ(mn/k)$ query complexity.

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

↑