betaFeedback

WorksComputer Science

Reducing Asymmetric Path TSP to Asymmetric TSP

Abstract

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.

Paper details

vlnc:W_avzz6gvv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

ChatGPT 6 Astra, Claude Opus 5.5

View statement
Looking for related papers…