arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.07359cs.DSmath.MG
收藏

大$δ$ -双曲图中$p$ -中心的快速近似算法

Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs

Katherine Edwards, W. Sean Kennedy, Iraj Saniee

摘要:

我们提供了一个准线性时间算法的$p$中心问题的附加误差小于或等于3倍的输入图的双曲常数。具体地说,对于图$G=(V,E)$与$n$顶点,$m$边和双曲常数$δ$,我们构造了一个算法的$p$ -中心的时间$O(p(δ+1)(n+m)\log(n))$的半径不超过$r_p + δ$时,$p \leq 2$和$r_p + 3δ$时,$p \geq 3$,其中$r_p$是最佳半径。以前的工作确定$p$ -中心与准确度$r_p+δ$,但与时间复杂度$O((n^3\log n + n^2m)\log(diam(G)))$,这是不切实际的大型图。

英文摘要:

We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic constant $δ$, we construct an algorithm for $p$-centers in time $O(p(δ+1)(n+m)\log(n))$ with radius not exceeding $r_p + δ$ when $p \leq 2$ and $r_p + 3δ$ when $p \geq 3$, where $r_p$ are the optimal radii. Prior work identified $p$-centers with accuracy $r_p+δ$ but with time complexity $O((n^3\log n + n^2m)\log(diam(G)))$ which is impractical for large graphs.

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

↑