An improved approximation algorithm for the maximum TSP
نویسندگان
چکیده
منابع مشابه
An Improved Randomized Approximation Algorithm for Max TSP
We present an O(n)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically 251 331 , where n is the number of vertices in the input (undirected) graph. This improves the previous best.
متن کاملAn Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expected ratio of 43 83 (1− ) (≈ 0.518(1− )) for any constant > 0. By modifying their algorithm, we obtain a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio of 0.5257...
متن کامل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...
متن کاملImproved deterministic approximation algorithms for Max TSP
We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...
متن کاملImproved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 78−o(1). Both algorithms improve on the previous bests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.03.012