计算网络的最优捷径
Computing optimal shortcuts for networks
摘要:
我们研究用一段称为捷径的线段来扩充平面欧几里得网络,以最小化所得到的网络边缘上任何两点之间的最大距离。这种类型的问题最近得到了相当大的关注,主要是离散变量的问题。我们考虑一个完全连续的设置,其中计算距离和放置捷径的问题要困难得多,因为必须考虑网络上的所有点,而不仅仅是顶点。我们提出的第一个结果在这个模型中的一般网络的最佳捷径的计算:多项式时间算法和离散化的问题,导致一个近似算法。我们还改进了一般的方法,网络的路径,限于两种类型的快捷方式:具有固定方向和简单的快捷方式。
英文摘要:
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem. We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this model: a polynomial time algorithm and a discretization of the problem that leads to an approximation algorithm. We also improve the general method for networks that are paths, restricted to two types of shortcuts: those with a fixed orientation and simple shortcuts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。