On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound
نویسندگان
چکیده
We show that an instance of traveling salesman problem (TSP) of size n with an asymmetric distance matrix can be transformed into an instance of TSP of size 2n with a symmetric distance matrix. This is an improvement over earlier transformations of this kind which triple the size of the problem. Next we use this transformation to obtain a Hamiltonian tour of a general TSP (which may be asymmetric and/or non-Eucledian) with the worst case performance ratio of 20 9 when the ratio γ := dmax dmin is smaller than 4 3 , and ( 11γ−8 3 ) otherwise.
منابع مشابه
Approximation Hardness of TSP with Bounded Metrics ( Revised
The general asymmetric TSP with triangle inequality is known to be approximable only to within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 131=130 and 174=173, respectively, for these problems, impro...
متن کاملTSP with bounded metrics
The general asymmetric TSP with triangle inequality is known to be approximable only within logarithmic factors. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics, i.e., metrics where the distances are integers between one and some constant upper bound. In this case, the problem is known to be approximable within a constant factor. We prove that it is NP-hard...
متن کاملApproximation Hardness of TSP with Bounded Metrics
The general asymmetric TSP with triangle inequality is known to be approximable only within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics, i.e., metrics where the distances are integers between one and some upper bound B. We first prove appr...
متن کاملSelection of Relaxation Problems for a Class of Asymmetric Traveling Salesman Problem Instances
It is commonly believed that the use of the assignment problem works well when one selects a relaxation problem within the framework of a branch and bound algorithm to solve an asymmetric traveling salesman problem (TS P) optimally. In this paper, we present asymmetric TSP instances found in real-life setting, and show that t.he above common belief is not necessarily appropriate. Based on the r...
متن کاملTheory and Methodology Construction heuristics for the asymmetric TSP
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. This state of aairs is at odds with the fact that asymmetric models are relevant to a wider range of applications, and indeed are un...
متن کامل