Gromov 近似树与全点对瓶颈路径问题
Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
AI总结:
本文建立 Gromov 近似树计算与全点对瓶颈路径问题之间的双向归约,并给出由邻接矩阵在二次时间内构造图的 Gromov 近似树的显式算法。
摘要:
给定一个包含 n 个点的尖度量空间 $(X,\mathsf{dist}, w)$,其 Gromov 近似树是一个 0-双曲伪度量空间 $(X,\mathsf{dist}_T)$,满足 $\mathsf{dist}(x,w)=\mathsf{dist}_T(x,w)$,并且对所有 $x,y\in X$ 有 $\mathsf{dist}(x,y)-2\delta\log_2 n\leq \mathsf{dist}_T(x,y)\leq \mathsf{dist}(x,y)$,其中 $\delta$ 是 $X$ 的 Gromov 双曲度。另一方面,全点对瓶颈路径(APBP)问题要求:给定一个边上具有某些容量的无向图,找出每一对顶点之间的最大路径容量。在本短文中,我们证明:根据一个含 $n+1$ 个点的度量空间的距离矩阵计算其 Gromov 近似树,可归约为在一个含 $n$ 个顶点的连通图上求解 APBP 问题;存在一个显式算法,可根据图的邻接矩阵在二次时间内计算该图的 Gromov 近似树;在一个含 $n$ 个顶点的加权图上求解 APBP 问题,可归约为根据一个含 $n+1$ 个点的度量空间的距离矩阵寻找其 Gromov 近似树。
英文摘要:
Given a pointed metric space $(X,\mathsf{dist}, w)$ on $n$ points, its Gromov's approximating tree is a 0-hyperbolic pseudo-metric space $(X,\mathsf{dist}_T)$ such that $\mathsf{dist}(x,w)=\mathsf{dist}_T(x,w)$ and $\mathsf{dist}(x, y)-2 δ\log_2n \leq \mathsf{dist}_T (x, y) \leq \mathsf{dist}(x, y)$ for all $x, y \in X$ where $δ$ is the Gromov hyperbolicity of $X$. On the other hand, the all pairs bottleneck paths (APBP) problem asks, given an undirected graph with some capacities on its edges, to find the maximal path capacity between each pair of vertices. In this note, we prove: $\bullet$ Computing Gromov's approximating tree for a metric space with $n+1$ points from its matrix of distances reduces to solving the APBP problem on an connected graph with $n$ vertices. $\bullet$ There is an explicit algorithm that computes Gromov's approximating tree for a graph from its adjacency matrix in quadratic time. $\bullet$ Solving the APBP problem on a weighted graph with $n$ vertices reduces to finding Gromov's approximating tree for a metric space with $n+1$ points from its distance matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。