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

机组优化设计的两个问题

Two Optimization Problems for Unit Disks

Sergio Cabello, Lazar Milinković

摘要:

我们提出了一个最近的算法来计算最短路径树在单位磁盘图在$O(n\log n)$最坏情况下的时间,其中$n$是磁盘的数量。在最小分离问题中,我们给定$n$单位圆盘和两个不包含在任何圆盘中的点$s$和$t$,我们想计算需要保留的最小圆盘数,以便连接$s$和$t$的任何曲线与某些保留的圆盘相交。我们提出了一种新的算法解决这个问题在$O(n^2\log^3 n)$最坏情况下的时间和实现。

英文摘要:

We present an implementation of a recent algorithm to compute shortest-path trees in unit disk graphs in $O(n\log n)$ worst-case time, where $n$ is the number of disks. In the minimum-separation problem, we are given $n$ unit disks and two points $s$ and $t$, not contained in any of the disks, and we want to compute the minimum number of disks one needs to retain so that any curve connecting $s$ to $t$ intersects some of the retained disks. We present a new algorithm solving this problem in $O(n^2\log^3 n)$ worst-case time and its implementation.

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

↑