arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.06563cs.CCcs.DSmath.PRstat.ML
收藏

最大独立集的最优低阶硬度

Optimal Low-Degree Hardness of Maximum Independent Set

Alexander S. Wein

摘要:

研究了在具有$d$和$n$顶点的稀疏Erdens-Rényi随机图中寻找大独立集的算法问题.已知最大独立集的大小为$(2 \log d / d)n$,在$n \to \infty$之后是$d \to \infty$的双重极限中,但最著名的多项式时间算法只能找到半最优大小为$(\log d / d)n$的独立集。我们表明,类的低次多项式算法可以找到独立集的半最优大小,但没有更大的,改进后的结果Gamarnik,Jagannath,和作者。这推广了Rahman和Virág的早期工作,他们证明了弱局部算法类的类似结果。

英文摘要:

We study the algorithmic task of finding a large independent set in a sparse Erdős-Rényi random graph with $n$ vertices and average degree $d$. The maximum independent set is known to have size $(2 \log d / d)n$ in the double limit $n \to \infty$ followed by $d \to \infty$, but the best known polynomial-time algorithms can only find an independent set of half-optimal size $(\log d / d)n$. We show that the class of low-degree polynomial algorithms can find independent sets of half-optimal size but no larger, improving upon a result of Gamarnik, Jagannath, and the author. This generalizes earlier work by Rahman and Virág, which proved the analogous result for the weaker class of local algorithms.

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

↑