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

关于Fréchet旅行商问题

On Fréchet Traveling Salesmen Problems

The Open University of Israel(以色列开放大学)

Omrit Filtser, Tzalik Maimon, Michal Moiseev

AI总结:

研究在给定点集上构造两条曲线,使得它们之间的Fréchet距离最小,并提出了离散Fréchet距离下的近线性算法,证明了连续Fréchet距离下问题的NP难性。

摘要:

Fréchet距离是一种被广泛研究的曲线间距离度量。在这项工作中,我们展示了Fréchet距离的价值不仅限于评估相似性,并引入了一个新的场景,其中它被证明是有用的。考虑一种情况,两个代理需要访问一组给定的站点,同时在整个遍历过程中彼此保持接近。在本文中,我们研究的问题目标是构造两条曲线,其顶点来自给定的点集,并满足曲线之间的Fréchet距离尽可能小的约束。这个问题可以被视为旅行商问题(TSP)的一个变体,因此可能在路由、网络规划等领域具有意义。我们提出了一个在离散Fréchet距离下解决该问题的近线性算法,并探讨了该问题的几个变体,包括最小化曲线长度和平衡分配给每个代理的站点数量。最后,我们证明了在连续Fréchet距离下该问题是NP难的。

英文摘要:

The Fréchet distance is a well-studied distance measure between two curves. In this work, we demonstrate that the merit of Fréchet distance extends beyond evaluating similarity, and introduce a new setting in which it proves useful. Consider a situation where two agents are required to visit a given set of sites, while staying close to each other throughout their traversal. In this paper, we study problems where the goal is to construct two curves whose vertices are from a given set of points, under the constraint that the Fréchet distance between the curves is kept as small as possible. This problem can be viewed as a variant of the Traveling Salesman Problem (TSP), and thus may be of interest in routing, network planning and more. We present a near-linear algorithm for this problem under the discrete Fréchet distance, and explore several variants of the problem, including minimizing the lengths of the curves and balancing the number of sites assigned to each agent. Lastly, we prove that the problem is NP-hard under the continuous Fréchet Distance.

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

↑