35/44-approximation for Asymmetric maxTSP with Triangle Inequality
نویسندگان
چکیده
We describe a new approximation algorithm for the asymmetric maxTSP with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 10/13 factor of Kaplan et al. [5].
منابع مشابه
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
We consider the asymmetric traveling salesperson problem with γ-parameterized triangle inequality for γ ∈ [ 1 2 , 1). That means, the edge weights fulfill w(u, v) ≤ γ · (w(u, x) + w(x, v)) for all nodes u, v, x. Chandran and Ram [8] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio γ 1−γ . We devise an a...
متن کاملA Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like several existing algorithms, it achieves approximation ratio O(log n). Unlike previous algorithms, it uses randomized rounding.
متن کامل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...
متن کاملTwo Approximation Algorithms for ATSP with Strengthened Triangle Inequality
In this paper, we study the asymmetric traveling salesman problem (ATSP) with strengthened triangle inequality, i.e. for some γ ∈ [ 1 2 , 1) the edge weights satisfy w(u, v) ≤ γ(w(u, x) + w(x, v)) for all distinct vertices u, v, x. We present two approximation algorithms for this problem. The first one is very simple and has approximation ratio 1 2(1−γ) , which is better than all previous resul...
متن کامل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...
متن کامل