arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.01093cs.CGmath.OC
收藏

流形上的TSP

TSP on manifolds

David Zisselman

AI总结:

本文通过定义有界曲率曲面嵌入空间,为TSP问题构造PTAS,并证明有界倍增维数空间和一致度量空间均可嵌入此类曲面,从而推广了已有TSP近似方案。

摘要:

在本文中,我们提出了一种通过定义有界曲率曲面嵌入空间来为TSP问题构造PTAS的新方法。利用这一定义,我们证明:有界曲率曲面嵌入空间中的TSP存在PTAS;每个有界倍增维数空间都可以嵌入到有界曲率曲面中;每个一致度量空间都可以嵌入到有界曲率曲面中。因此,该算法推广了arXiv:1112.0699(并且因此也推广了[7]和[8]中关于TSP的PTAS结果)。但是,该算法的适用范围要广泛得多,因为一致度量空间并不都是有界倍增维数空间。需要指出的是,我们对曲面的定义源自黎曼几何,但并不与其完全一致。因此,本文完整给出了我们的定义和基础几何算法。

英文摘要:

In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. - Every bounded doubling dimension space can be embedded into a bounded-curvature surface. - Every uniform metric space can be embedded into a bounded-curvature surface. Thus, the algorithm generalizes arXiv:1112.0699 (and therefore [7] and [8] as well, w.r.t PTAS of TSP). But, the algorithm is much broader as uniform metric spaces aren't bounded doubling dimension spaces. It should be mentioned that our definition of a surface is derived from Riemannian geometry, but doesn't match it exactly. therefore, our definitions and basic geometry algorithm is given here in full. [7] Sanjeev Arora. 1998. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 5 (September 1998), 753-782. DOI=http://dx.doi.org/10.1145/290179.290180 [8] Joseph S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial time approximation scheme for geometric TSP, k- MST, and related problems. SIAM J. Comput., 28(4):1298-1309, 1999.

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

↑