使用Noisy-Voronoi算法消除失真$O(\log k)$的Steiner点
Steiner Point Removal with distortion $O(\log k)$, using the Noisy-Voronoi algorithm
摘要:
在Steiner点移除(SPR)问题中,我们给出了一个加权图$G=(V,E)$和一组大小为$k$的终端$K\subset V$.我们的目标是找到一个次要的$M$的$G$与终端作为其顶点集,使终端之间的距离将被保留到一个小的乘法失真。Kamma、Krauthgamer和Nguyen [SICOMP 2015]设计了一种具有指数分布的球增长算法,以表明失真最多为$O(\log^5 k)$。Cheung [SODA 2018]改进了相同算法的分析,通过$O(\log^2 k)$限制失真。我们设计了一种新的和更简单的算法(称为噪声Voronoi算法),招致失真$O(\log k)$。该算法可以在几乎线性时间($O(|E|\log |V|)$)内实现。
英文摘要:
In the Steiner Point Removal (SPR) problem, we are given a weighted graph $G=(V,E)$ and a set of terminals $K\subset V$ of size $k$. The objective is to find a minor $M$ of $G$ with only the terminals as its vertex set, such that distances between the terminals will be preserved up to a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [SICOMP2015] devised a ball-growing algorithm with exponential distributions to show that the distortion is at most $O(\log^5 k)$. Cheung [SODA2018] improved the analysis of the same algorithm, bounding the distortion by $O(\log^2 k)$. We devise a novel and simpler algorithm (called the Noisy Voronoi algorithm) which incurs distortion $O(\log k)$. This algorithm can be implemented in almost linear time ($O(|E|\log |V|)$).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。