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

图直径和偏心率的紧逼近界

Towards Tight Approximation Bounds for Graph Diameter and Eccentricities

Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein

摘要:

其中最重要的图形参数是直径,任何两个顶点之间的最大距离。没有已知的非常有效的算法来精确地计算直径。因此,许多研究致力于如何快速地近似这个参数。Alfrehik等人表明,直径可以近似为$\tilde{O}(m^{3/2})$时间中$3/2$的乘法因子。此外,Roditty和Vassilevska W.表明,除非强指数时间假设(SETH)失败,否则没有$O(n^{2-ε})$时间算法可以在稀疏图中获得比$3/2$更好的近似因子。因此,对于逼近因子小于$3/2$的稀疏图,上述算法本质上是最佳的。然而,$3/2$ -近似在线性时间中是完全可能的。在这项工作中,我们有条件地排除这种可能性,除非SETH失败,没有$O(m^{3/2-ε})$时间算法可以实现比$5/3$更好的近似因子。另一组基本的图形参数是偏心率。顶点$v$的偏心率是$v$与距离$v$最远的顶点之间的距离。Abkhik等人证明了所有顶点的偏心率可以在$\tilde{O}(m^{3/2})$时间上近似在$5/3$的因子内,Abboud等人证明了在稀疏图中没有$O(n^{2-ε})$算法可以实现比$5/3$更好的近似。我们表明,$5/3$近似算法的运行时间也是最佳的SETH。我们还表明,没有近线性的时间算法可以实现一个更好的$2$近似的偏心率,这基本上是紧的:我们给出了一个算法,近似偏心率在一个$2+δ$因子在$\tilde{O}(m/δ)$的时间为任何$0<δ<1$。这击败了Cairo等人的所有偏心算法。

英文摘要:

Among the most important graph parameters is the Diameter, the largest distance between any two vertices. There are no known very efficient algorithms for computing the Diameter exactly. Thus, much research has been devoted to how fast this parameter can be approximated. Chechik et al. showed that the diameter can be approximated within a multiplicative factor of $3/2$ in $\tilde{O}(m^{3/2})$ time. Furthermore, Roditty and Vassilevska W. showed that unless the Strong Exponential Time Hypothesis (SETH) fails, no $O(n^{2-ε})$ time algorithm can achieve an approximation factor better than $3/2$ in sparse graphs. Thus the above algorithm is essentially optimal for sparse graphs for approximation factors less than $3/2$. It was, however, completely plausible that a $3/2$-approximation is possible in linear time. In this work we conditionally rule out such a possibility by showing that unless SETH fails no $O(m^{3/2-ε})$ time algorithm can achieve an approximation factor better than $5/3$. Another fundamental set of graph parameters are the Eccentricities. The Eccentricity of a vertex $v$ is the distance between $v$ and the farthest vertex from $v$. Chechik et al. showed that the Eccentricities of all vertices can be approximated within a factor of $5/3$ in $\tilde{O}(m^{3/2})$ time and Abboud et al. showed that no $O(n^{2-ε})$ algorithm can achieve better than $5/3$ approximation in sparse graphs. We show that the runtime of the $5/3$ approximation algorithm is also optimal under SETH. We also show that no near-linear time algorithm can achieve a better than $2$ approximation for the Eccentricities and that this is essentially tight: we give an algorithm that approximates Eccentricities within a $2+δ$ factor in $\tilde{O}(m/δ)$ time for any $0<δ<1$. This beats all Eccentricity algorithms in Cairo et al.

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

↑