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

寻找三角形或独立集;以及其他对偶对近似

Finding Triangles or Independent Sets; and Other Dual Pair Approximations

Adrian Dumitrescu

AI总结:

本文提出多个新算法,在图中寻找三角形或独立集/图着色近似,并引入对偶对概念,以在难以单独求解时高效找到两者之一。

摘要:

我们重新审视在图(\textsc{三角形检测})中寻找三角形的算法问题,并考察其与其他问题(如\textsc{3Sum}、\textsc{独立集}和\textsc{图着色})的关系。我们获得了几个新算法:\n(I) 一个用于在图中寻找三角形的简单随机算法。作为一个应用,我们研究了Pǎtraşcu(2010年)关于三角形检测问题的猜想范围。\n(II) 一个算法,给定图$G=(V,E)$,在$O(m+n)$(即线性)时间内执行以下任务之一:(i) 计算$G$中最大独立集的$\Omega(1/\sqrt{n})$近似,或(ii) 在$G$中找到一个三角形。其运行时间比任何先前方法对这些任务中的每一个都要快。\n(III) 一个算法,给定图$G=(V,E)$,在$O(m+n^{3/2})$时间内执行以下任务之一:(i) 计算$G$的\textsc{图着色}的$\sqrt{n}$近似,或(ii) 在$G$中找到一个三角形。对于稠密图(其中$m =\omega(n^{9/8})$),其运行时间比任何先前方法对这些任务中的每一个都要快。\n(IV) 第二个和第三个结果提出了以下更广泛的研究方向:如果单独找到(A)或(B)是困难的,能否高效地找到两者之一?这激发了我们对偶对概念的引入。我们讨论并提供了对偶对近似的几个实例。

英文摘要:

We revisit the algorithmic problem of finding a triangle in a graph (\textsc{Triangle Detection}), and examine its relation to other problems such as \textsc{3Sum}, \textsc{Independent Set}, and \textsc{Graph Coloring}. We obtain several new algorithms: \smallskip (I) A simple randomized algorithm for finding a triangle in a graph. As an application, we study the range of a conjecture of Pǎtraşcu (2010) regarding the triangle detection problem. \smallskip (II) An algorithm which given a graph $G=(V,E)$ performs one of the following tasks in $O(m+n)$ (ie, linear) time: (i)~compute a $Ω(1/\sqrt{n})$-approximation of a maximum independent set in $G$ or (ii)~find a triangle in $G$. The run-time is faster than that for any previous method for each of these tasks. \smallskip (III) An algorithm which given a graph $G=(V,E)$ performs one of the following tasks in $O(m+n^{3/2})$ time: (i)~compute an $\sqrt{n}$-approximation for \textsc{Graph Coloring} of $G$ or (ii)~find a triangle in $G$. The run-time is faster than that for any previous method for each of these tasks on dense graphs, with $m =ω(n^{9/8})$. \smallskip (IV) The second and third results suggest the following broader research direction: if it is difficult to find (A) or (B) separately, can one find one of the two efficiently? This motivates the \emph{dual pair} concept we introduce. We discuss and provide several instances of dual-pair approximation.

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

↑