arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.02412math.MGcs.CG
收藏

圈子的捷径

Shortcuts for the Circle

Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos

摘要:

令$C$为$\mathbb{R}^2$中的单位圆。我们可以把$C$看作一个平面图,它的顶点是$C$上的所有点,$C$上任意两点之间的距离是它们之间较小弧的长度。我们考虑$C$上的一个图扩充问题,我们想把$k\geq 1$ \emph{shortcuts}放在$C$上,使得得到的图的直径最小化。我们用$1\leq k\leq 7$分析每个$k$的最佳捷径集是什么。有趣的是,可以获得的最小直径不是~ $k$的严格递减函数。例如,使用七个快捷方式不能获得比使用六个快捷方式更小的直径。最后,我们证明了对于任意的~ $k$,最佳直径是$2 + Θ(1/k^{\frac{2}{3}})$.

英文摘要:

Let $C$ be the unit circle in $\mathbb{R}^2$. We can view $C$ as a plane graph whose vertices are all the points on $C$, and the distance between any two points on $C$ is the length of the smaller arc between them. We consider a graph augmentation problem on $C$, where we want to place $k\geq 1$ \emph{shortcuts} on $C$ such that the diameter of the resulting graph is minimized. We analyze for each $k$ with $1\leq k\leq 7$ what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly decreasing function of~$k$. For example, with seven shortcuts one cannot obtain a smaller diameter than with six shortcuts. Finally, we prove that the optimal diameter is $2 + Θ(1/k^{\frac{2}{3}})$ for any~$k$.

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

↑