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

Steiner 点移除问题的 $\tilde\Omega\big(\sqrt{\log |T|}\big)$ 下界

An $\tildeΩ\big(\sqrt{\log |T|}\big)$ Lower Bound for Steiner Point Removal

Yu Chen, Zihan Tan

AI总结:

针对 Steiner 点移除问题,本文证明了拉伸下界从常数 8 提升至 $\tilde\Omega(\sqrt{\log |T|})$,改进了已知结果。

摘要:

在 Steiner 点移除(SPR)问题中,给定一个(带权)图 $G$ 及其顶点子集 $T$(称为终端),目标是计算一个以 $T$ 为顶点集的(带权)图 $H$,使得 $H$ 是 $G$ 的 Minor,并且任意一对终端之间的距离都保持在一个较小的乘法因子范围内,该因子称为 $H$ 的拉伸(stretch)。已有研究表明,在一般图上可以实现 $O(\log |T|)$ 的拉伸 [Filtser, 2018]。另一方面,此前已知的最佳拉伸下界为 $8$ [Chan-Xia-Konjevod-Richa, 2006],该下界甚至对树也成立。在本工作中,我们证明了改进的下界 $\tilde\Omega\big(\sqrt{\log |T|}\big)$。

英文摘要:

In the Steiner point removal (SPR) problem, we are given a (weighted) graph $G$ and a subset $T$ of its vertices called terminals, and the goal is to compute a (weighted) graph $H$ on $T$ that is a minor of $G$, such that the distance between every pair of terminals is preserved to within some small multiplicative factor, that is called the stretch of $H$. It has been shown that on general graphs we can achieve stretch $O(\log |T|)$ [Filtser, 2018]. On the other hand, the best-known stretch lower bound is $8$ [Chan-Xia-Konjevod-Richa, 2006], which holds even for trees. In this work, we show an improved lower bound of $\tildeΩ\big(\sqrt{\log |T|}\big)$.

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

↑