arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.04381cs.DS
收藏

基于独立集查询的近最优边缘估计

Nearly optimal edge estimation with independent set queries

Xi Chen, Amit Levi, Erik Waingarten

摘要:

我们研究了一个未知的,无向图$G=([n],E)$访问一个独立集预言的边数估计的问题。当查询顶点的子集$S\subseteq [n]$时,独立集oracle回答$S$是否是$G$中的独立集。我们的第一个主要结果是一个算法,计算$(1+ε)$的边缘$m$的图形使用$\min(\sqrt{m},n / \sqrt{m})\cdot\textrm{poly}(\log n,1/ε)$独立集查询的数量近似。这改进了Beame等人的\cite{BHRRS18}的$\min(\sqrt{m},n^2/m)\cdot\textrm{poly}(\log n,1/ε)$的上界。我们的第二个主要结果表明,${\min(\sqrt{m},n/\sqrt{m}))/\textrm{polylog}(n)}$独立集查询是必要的,从而建立我们的算法是最佳的$\textrm{poly}(\log n, 1/ε)$的一个因素。

英文摘要:

We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+ε)$-approximation of the number of edges $m$ of the graph using $\min(\sqrt{m},n / \sqrt{m})\cdot\textrm{poly}(\log n,1/ε)$ independent set queries. This improves the upper bound of $\min(\sqrt{m},n^2/m)\cdot\textrm{poly}(\log n,1/ε)$ by Beame et al. \cite{BHRRS18}. Our second main result shows that ${\min(\sqrt{m},n/\sqrt{m}))/\textrm{polylog}(n)}$ independent set queries are necessary, thus establishing that our algorithm is optimal up to a factor of $\textrm{poly}(\log n, 1/ε)$.

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

↑