重新访问邻域的TSP的截断方法
The guillotine approach for TSP with neighborhoods revisited
摘要:
具有邻域的欧几里得TSP(TSPN)是以下问题:给定一个k个区域的集合R,找到从每个区域访问至少一个点的最短行程。我们研究了不相交的、连接的、α脂肪区域的特殊情况(即,每个区域P包含直径为diam(P)/alpha的圆盘和不相交的单位圆盘。对于后者,Dumitrescu和Mitchell提出了一种基于Mitchell的截断细分方法的算法,并声称它是一种PTAS。然而,他们的证明包含一个严重的差距,我们将在下面关闭。Bodlaender等人评论说,他们的最小走廊连接问题的技术延续到TSPN,并为这个问题产生一个替代的PTAS。对于不同大小的不相交连接的α-脂肪区域,米切尔提出了一个略有不同的PTAS候选。我们将揭示这种方法中的几个进一步的问题和差距。其中一些我们可以关闭,但总的来说,对于α-脂肪区域,TSPN的PTAS的存在仍然是开放的。
英文摘要:
The Euclidean TSP with neighborhoods (TSPN) is the following problem: Given a set R of k regions, find a shortest tour that visits at least one point from each region. We study the special cases of disjoint, connected, alpha-fat regions (i.e., every region P contains a disk of diameter diam(P)/alpha) and disjoint unit disks. For the latter, Dumitrescu and Mitchell proposed an algorithm based on Mitchell's guillotine subdivision approach for the Euclidean TSP and claimed it to be a PTAS. However, their proof contains a severe gap, which we will close in the following. Bodlaender et al. remark that their techniques for the minimum corridor connection problem carry over to the TSPN and yield an alternative PTAS for this problem. For disjoint connected alpha-fat regions of varying size, Mitchell proposed a slightly different PTAS candidate. We will expose several further problems and gaps in this approach. Some of them we can close, but overall, for alpha-fat regions, the existence of a PTAS for the TSPN remains open.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。