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

关于成对扳手

On Pairwise Spanners

Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha

摘要:

给定一个无向$n$ -节点无权图$G = (V, E)$,一个具有拉伸函数$f(\cdot)$的图是一个子图$H\subseteq G$,使得如果两个节点在$G$中的距离为$d$,那么它们在$H$中的距离至多为$f(d)$。扳手在文献中有很好的研究。典型的目标是为给定的拉伸函数构造稀疏的可能性。在本文中,我们研究两两的空间,我们需要近似的$u$-$v$距离只有对$(u,v)$在一个给定的集合$\cP \subseteq V\times V$。在[Coppermith,Elkin'05]之前,仅在$f(\cdot)$是恒等函数的特殊情况下研究了这种$\cP$ -spectrometry,即相关对之间的距离必须精确保留(a.k.a.两两交叉)。在这里,我们提出了成对的spectrum,这是在同一时间稀疏比最知名的spectrum(在同一$\cP$)和最知名的spectrum(具有相同的$f(\cdot)$)。更详细地说,对于任意的$\cP$,我们证明了存在一个$\mathcal{P}$ -矩阵,其大小为$O(n(|\cP|\log n)^{1/4})$,且具有$f(d)=d+4\log n$。或者,对于任何$\eps>0$,存在大小为$O(n|\cP|^{1/4}\sqrt{\frac{\log n}{\eps}})$且具有$f(d)=(1+\eps)d+4$的$\cP$ -簇。我们还考虑了相关的特殊情况下,有一个关键的节点集$S\subseteq V$,我们希望近似的距离内的节点在$S$或从节点在$S$任何其他节点。我们证明了存在一个$(S\times S)$ -簇,其大小为$O(n\sqrt{|S|})$与$f(d)=d+2$,以及一个$(S\times V)$ -簇,其大小为$O(n\sqrt{|S|\log n})$与$f(d)=d+2\log n$。所有提到的成对空间都可以在多项式时间内构造。

英文摘要:

Given an undirected $n$-node unweighted graph $G = (V, E)$, a spanner with stretch function $f(\cdot)$ is a subgraph $H\subseteq G$ such that, if two nodes are at distance $d$ in $G$, then they are at distance at most $f(d)$ in $H$. Spanners are very well studied in the literature. The typical goal is to construct the sparsest possible spanner for a given stretch function. In this paper we study pairwise spanners, where we require to approximate the $u$-$v$ distance only for pairs $(u,v)$ in a given set $\cP \subseteq V\times V$. Such $\cP$-spanners were studied before [Coppersmith,Elkin'05] only in the special case that $f(\cdot)$ is the identity function, i.e. distances between relevant pairs must be preserved exactly (a.k.a. pairwise preservers). Here we present pairwise spanners which are at the same time sparser than the best known preservers (on the same $\cP$) and of the best known spanners (with the same $f(\cdot)$). In more detail, for arbitrary $\cP$, we show that there exists a $\mathcal{P}$-spanner of size $O(n(|\cP|\log n)^{1/4})$ with $f(d)=d+4\log n$. Alternatively, for any $\eps>0$, there exists a $\cP$-spanner of size $O(n|\cP|^{1/4}\sqrt{\frac{\log n}{\eps}})$ with $f(d)=(1+\eps)d+4$. We also consider the relevant special case that there is a critical set of nodes $S\subseteq V$, and we wish to approximate either the distances within nodes in $S$ or from nodes in $S$ to any other node. We show that there exists an $(S\times S)$-spanner of size $O(n\sqrt{|S|})$ with $f(d)=d+2$, and an $(S\times V)$-spanner of size $O(n\sqrt{|S|\log n})$ with $f(d)=d+2\log n$. All the mentioned pairwise spanners can be constructed in polynomial time.

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

↑