平面上直线和射线的旅行商问题
The traveling salesman problem for lines and rays in the plane
摘要:
在具有邻域的欧几里德TSP(TSPN)中,我们给出了$n$区域(邻域)的集合,并且我们寻求访问每个区域的最短行程。在路径变量中,我们寻求访问每个区域的最短路径。我们提出了几个线性时间的近似算法与这些问题的两种情况下,(无限)线,分别是(半无限)射线的邻居改进的比率。一路上,我们推导出一个紧边界上的最小周长的矩形包围开放曲线的长度$L$。
英文摘要:
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays. Along the way we derive a tight bound on the minimum perimeter of a rectangle enclosing an open curve of length $L$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。