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

简单多边形中双巡视员路径的近似算法

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Bengt J. Nilsson, Eli Packer

AI总结:

本文针对简单多边形中的双巡视员路径问题,提出两个常数因子近似算法,分别实现 5.969 和 11.939 的近似比,并将技术扩展到固定起点情形,获得 6.922-近似算法。

摘要:

双巡视员路径问题是指在某个环境中计算一对闭合巡视路线,使得这两条路线合起来能够看到整个环境,并且使这两条路线上的某种长度度量最小。两种标准度量是:minmax 度量,即希望两条路线中最长的那条长度尽可能小;以及 minsum 度量,即希望两条路线长度之和尽可能小。已知对于简单直线多边形,计算 minmax 双巡视员路径是 NP 难的,因此对于简单多边形也是 NP 难的。此外,任何针对 minmax 双巡视员路径的 c-近似算法都自动成为针对 minsum 双巡视员路径的 2c-近似算法。我们给出了两个用于在简单多边形中计算 minmax 双巡视员路径的常数因子近似算法,近似因子分别为 5.969 和 11.939,运行时间分别为 O(n^8) 和 O(n^4),其中 n 是多边形的顶点数。我们还使用相同技术为固定双巡视员路径问题获得了一个 6.922-近似算法,运行时间为 O(n^2),即当两条巡视路线的两个起点作为输入给出时的情况。

英文摘要:

The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the two tours is minimized. Two standard measures are: the minmax measure, where we want the tours where the longest of them has smallest length, and the minsum measure, where we want the tours for which the sum of their lengths is the smallest. It is known that computing a minmax two-watchman route is NP-hard for simple rectilinear polygons and thus also for simple polygons. Also, any c-approximation algorithm for the minmax two-watchman route is automatically a 2c-approximation algorithm for the minsum two-watchman route. We exhibit two constant factor approximation algorithms for computing minmax two-watchman routes in simple polygons with approximation factors 5.969 and 11.939, having running times O(n^8) and O(n^4) respectively, where n is the number of vertices of the polygon. We also use the same techniques to obtain a 6.922-approximation for the fixed two-watchman route problem running in O(n^2) time, i.e., when two starting points of the two tours are given as input.

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

↑