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

简单图上最小$k$ -割的$n^k$障碍的突破

Breaking the $n^k$ Barrier for Minimum $k$-cut on Simple Graphs

Zhiyang He, Jason Li

摘要:

在最小$k$ -割问题中,我们希望找到最少数量的边,这些边的删除将输入图分解为至少$k$连通分量。Karger和Stein的经典算法在$\tilde O(n^{2k-2})$时间内运行,而最近令人兴奋的发展已经将运行时间改进为$O(n^k)$。对于一般的加权图,这是紧假设流行的硬度。在这项工作中,我们表明,也许令人惊讶的是,$O(n^k)$是不是简单的,未加权图的正确答案。我们设计了一个算法,在时间上运行$O(n^{(1-ε)k})$,其中$ε>0$是一个绝对常数,打破了自然的$n^k$障碍。这建立了未加权和加权情况下两个问题的分离。

英文摘要:

In the minimum $k$-cut problem, we want to find the minimum number of edges whose deletion breaks the input graph into at least $k$ connected components. The classic algorithm of Karger and Stein runs in $\tilde O(n^{2k-2})$ time, and recent, exciting developments have improved the running time to $O(n^k)$. For general, weighted graphs, this is tight assuming popular hardness conjectures. In this work, we show that perhaps surprisingly, $O(n^k)$ is not the right answer for simple, unweighted graphs. We design an algorithm that runs in time $O(n^{(1-ε)k})$ where $ε>0$ is an absolute constant, breaking the natural $n^k$ barrier. This establishes a separation of the two problems in the unweighted and weighted cases.

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

↑