← 研踪 PaperTrailarXiv:2611.21453 · v1
Reducing Asymmetric Path TSP to Asymmetric TSP
首次提交 2026-11-17 01:38
版本更新 2026-11-17 01:38
雷达观测 2026-11-17 16:10
摘要
In the Asymmetric Traveling Salesman Problem (Asymmetric TSP), we are given distances between vertices that satisfy the triangle inequality but need not be symmetric, and we seek a shortest tour through all vertices. In its path version, Asymmetric Path TSP, two vertices and are prescribed, and we seek a shortest path from to through all vertices. Both problems are equivalent to their versions with arbitrary nonnegative edge costs on a directed graph, in which vertices may be visited more than once. We show that for all constants and , any -approximation algorithm for Asymmetric TSP yields an -approximation algorithm for Asymmetric Path TSP. The best previous reduction of this kind, due to Feige and Singh, yields an -approximation algorithm. Our result answers an open question of Traub and Vygen. Consequently, every constant-factor approximation guarantee for Asymmetric TSP carries over to Asymmetric Path TSP up to an arbitrarily small additive error.
作者备注:20 pages, 3 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 01:38 · 最新观测版本
Reducing Asymmetric Path TSP to Asymmetric TSP
In the Asymmetric Traveling Salesman Problem (Asymmetric TSP), we are given distances between vertices that satisfy the triangle inequality but need not be symmetric, and we seek a shortest tour through all vertices. In its path version, Asymmetric Path TSP, two vertices and are prescribed, and we seek a shortest path from to through all vertices. Both problems are equivalent to their versions with arbitrary nonnegative edge costs on a directed graph, in which vertices may be visited more than once. We show that for all constants and , any -approximation algorithm for Asymmetric TSP yields an -approximation algorithm for Asymmetric Path TSP. The best previous reduction of this kind, due to Feige and Singh, yields an -approximation algorithm. Our result answers an open question of Traub and Vygen. Consequently, every constant-factor approximation guarantee for Asymmetric TSP carries over to Asymmetric Path TSP up to an arbitrarily small additive error.
查看此版本解读 →查看此版本原文 ↗