非重叠加权圆盘场景下的最短路径计算
Computing shortest paths amid non-overlapping weighted disks
AI总结:
该研究提出一种基于圆盘边界点离散化的近似算法,可在伪多项式时间内求解平面非重叠加权圆盘场景的加权区域最短路径问题,路径长度误差不超过(1+ε)倍最优解。
摘要:
本文提出一种近似算法,用于求解平面内n个非重叠加权圆盘集合场景下的加权区域问题。对于给定参数ε∈(0,1],近似路径的长度至多为实际最短路径长度的(1+ε)倍。该算法基于空间离散化思路,通过在圆盘边界上布设点实现离散化。借助这种离散化方式,可使用Dijkstra算法在(伪)多项式时间内计算所得几何图中的最短路径。
英文摘要:
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $ n $ non-overlapping weighted disks in the plane. For a given parameter $ \varepsilon \in (0,1]$, the length of the approximate path is at most $ (1 +\varepsilon) $ times larger than the length of the actual shortest path. The algorithm is based on the discretization of the space by placing points on the boundary of the disks. Using such a discretization we can use Dijkstra's algorithm for computing a shortest path in the geometric graph obtained in (pseudo-)polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。