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

带非线性项的TSP的常因子逼近

Constant-Factor Approximation for TSP with Disks

Adrian Dumitrescu, Csaba D. Tóth

摘要:

我们重新旅行商问题的邻域(TSPN),并提出了第一个常数比近似的磁盘在平面上:给定一组$n$磁盘在平面上,TSP巡回的长度是最多$O(1)$倍的最佳可以计算的时间是多项式在$n$。我们的结果是第一个常数比逼近一类平面凸体的任意大小和任意相交。为了实现一个$O(1)$ -近似,我们减少了旅行商问题的磁盘,常数因子,最小重量击中集问题的几何超图。在这里建立的TSPN和几何超图中的碰集之间的联系很可能有未来的应用。

英文摘要:

We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in time that is polynomial in $n$. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections. In order to achieve a $O(1)$-approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set problem in a geometric hypergraph. The connection between TSPN and hitting sets in geometric hypergraphs, established here, is likely to have future applications.

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

↑