新的路由技术及其应用
New routing techniques and their applications
摘要:
设$G=(V,E)$是一个具有$n$顶点和$m$边的无向图。我们得到了以下新的路由方案:-一个无权图的路由方案,它在每个顶点使用$\tilde O(\frac{1}ε n^{2/3})$空间和$\tilde O(1/ε)$ -位报头,在$(2 + ε,1)$ -拉伸路径上的任何一对顶点$u,v\in V$之间路由消息,即,长度至多为$(2+ε)\cdot d(u,v)+1$的路径。这应该与Patrascu和Roditty的$(2,1)$ -stretch和$\tilde O(n^{5/3})$空间距离oracle进行比较[FOCS'10和SIAM J. COMPUT. 2014]以及Abraham和Gavoille [DISC'11]的在每个顶点处使用$\tilde O( n^{3/4})$空间的$(2,1)$ -伸展路由方案。- 一种加权图的路由方案,它使用每个顶点的$\tilde O(\frac{1}ε n^{1/3}\log D)$空间和$\tilde O(\frac{1}ε\log D)$比特报头,在$(5+ε)$ -拉伸路径上的任何一对顶点之间路由消息。这应该与Thorup和Zwick的$5$ -拉伸和$\tilde O(n^{4/3})$空间距离预言进行比较[STOC'01 and J. ACM. 2005]以及Thorup和Zwick [SPAA'01]的在每个顶点处使用$\tilde O( n^{1/3})$空间的$7$ -伸展布线方案。由于$5$ -拉伸路由方案必须使用$Ω( n^{1/3})$空间表,因此我们的结果几乎是紧的。- 对于整数$\ell>1$,一种用于未加权图的路由方案,它使用每个顶点处的$\tilde O(\ell\frac{1}ε n^{\ell/(2\ell \pm 1)})$空间和$\tilde O(\frac{1}ε)$ -位报头,在$(3\pm2/\ell+ε,2)$ -拉伸路径上的任何一对顶点之间路由消息。-一种用于加权图的路由方案,它使用每个顶点处的$\tilde O(\frac{1}εn^{1/k}\log D)$空间和$\tilde O(\frac{1}ε\log D)$ -位报头,在$(4k-7+ε)$ -拉伸路径上的任何一对顶点之间路由消息。
英文摘要:
Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes: - A routing scheme for unweighted graphs that uses $\tilde O(\frac{1}ε n^{2/3})$ space at each vertex and $\tilde O(1/ε)$-bit headers, to route a message between any pair of vertices $u,v\in V$ on a $(2 + ε,1)$-stretch path, i.e., a path of length at most $(2+ε)\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-stretch routing scheme of Abraham and Gavoille [DISC'11] that uses $\tilde O( n^{3/4})$ space at each vertex. - A routing scheme for weighted graphs with normalized diameter $D$, that uses $\tilde O(\frac{1}ε n^{1/3}\log D)$ space at each vertex and $\tilde O(\frac{1}ε\log D)$-bit headers, to route a message between any pair of vertices on a $(5+ε)$-stretch path. This should be compared to the $5$-stretch and $\tilde O(n^{4/3})$ space distance oracle of Thorup and Zwick [STOC'01 and J. ACM. 2005] and to the $7$-stretch routing scheme of Thorup and Zwick [SPAA'01] that uses $\tilde O( n^{1/3})$ space at each vertex. Since a $5$-stretch routing scheme must use tables of $Ω( n^{1/3})$ space our result is almost tight. - For an integer $\ell>1$, a routing scheme for unweighted graphs that uses $\tilde O(\ell\frac{1}ε n^{\ell/(2\ell \pm 1)})$ space at each vertex and $\tilde O(\frac{1}ε)$-bit headers, to route a message between any pair of vertices on a $(3\pm2/\ell+ε,2)$-stretch path. - A routing scheme for weighted graphs, that uses $\tilde O(\frac{1}εn^{1/k}\log D)$ space at each vertex and $\tilde O(\frac{1}ε\log D)$-bit headers, to route a message between any pair of vertices on a $(4k-7+ε)$-stretch path.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。