跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

In the Asymmetric Traveling Salesman Problem (Asymmetric TSP), we are given distances between nn 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 ss and tt are prescribed, and we seek a shortest path from ss to tt 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 α≥1α\ge1 and ε>0\varepsilon>0, any αα-approximation algorithm for Asymmetric TSP yields an (α+ε)(α+\varepsilon)-approximation algorithm for Asymmetric Path TSP. The best previous reduction of this kind, due to Feige and Singh, yields an α(2+ε)α(2+\varepsilon)-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

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 nn 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 ss and tt are prescribed, and we seek a shortest path from ss to tt 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 α≥1α\ge1 and ε>0\varepsilon>0, any αα-approximation algorithm for Asymmetric TSP yields an (α+ε)(α+\varepsilon)-approximation algorithm for Asymmetric Path TSP. The best previous reduction of this kind, due to Feige and Singh, yields an α(2+ε)α(2+\varepsilon)-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.

查看此版本解读 →查看此版本原文 ↗