arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.08342cs.DScs.DMmath.CO
收藏

保持终端距离近似上下界的图的子式

Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds

Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger

摘要:

给定其中顶点被划分为$k$终端和非终端的图,目标是压缩图(即,压缩图的失真是所有终端对之间距离的最大乘性爆破。我们研究了非终端的数量和失真之间的权衡。这个问题推广了Steiner点移除(SPR)问题,其中所有的非终端必须被移除。我们引入了一种新的黑盒减少到一个超线性的下界上的非终端的数量,具有相同的失真,我们的问题转换为SPR问题的失真的任何下限。这使我们能够证明存在这样的图,即失真小于$2~/~2.5~/~3$的每个小调都必须具有$Ω(k^2)~/~Ω(k^{5/4})~/~Ω(k^{6/5})$非终结符,以及两者之间的更多权衡。黑箱约简有一个有趣的结果:如果SPR问题的失真的严格下界是超常数,那么允许任何$O(k)$非终结符将无助于将下界改进为常数。我们还建立在现有的结果空间,距离预言机和连接0-扩展,以显示一些上界一般图,平面图,图,排除一个固定的未成年人和有界树宽图。其中,我们表明,任何图承认一个未成年人与$O(\log k)$失真和$O(k^{2})$非终端,和任何平面图承认一个未成年人与$1+\varepsilon$失真和$\widetilde{O}((k/\varepsilon)^{2})$非终端。

英文摘要:

Given a graph where vertices are partitioned into $k$ terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately.The distortion of a compressed graph is the maximum multiplicative blow-up of distances between all pairs of terminals. We study the trade-off between the number of non-terminals and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem, in which all non-terminals must be removed. We introduce a novel black-box reduction to convert any lower bound on distortion for the SPR problem into a super-linear lower bound on the number of non-terminals, with the same distortion, for our problem. This allows us to show that there exist graphs such that every minor with distortion less than $2~/~2.5~/~3$ must have $Ω(k^2)~/~Ω(k^{5/4})~/~Ω(k^{6/5})$ non-terminals, plus more trade-offs in between. The black-box reduction has an interesting consequence: if the tight lower bound on distortion for the SPR problem is super-constant, then allowing any $O(k)$ non-terminals will not help improving the lower bound to a constant. We also build on the existing results on spanners, distance oracles and connected 0-extensions to show a number of upper bounds for general graphs, planar graphs, graphs that exclude a fixed minor and bounded treewidth graphs. Among others, we show that any graph admits a minor with $O(\log k)$ distortion and $O(k^{2})$ non-terminals, and any planar graph admits a minor with $1+\varepsilon$ distortion and $\widetilde{O}((k/\varepsilon)^{2})$ non-terminals.

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

↑