An Improved Randomized Approximation Algorithm for Max 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.
متن کامل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.
متن کاملSingle Approximation for Biobjective Max TSP
We mainly study Max TSP with two objective functions. We propose an algorithm which returns a single Hamiltonian cycle with performance guarantee on both objectives. The algorithm is analysed in three cases. When both (resp. at least one) objective function(s) fulfill(s) the triangle inequality, the approximation ratio is 5 12 − ε ≈ 0.41 (resp. 3 8 − ε). When the triangle inequality is not assu...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2005
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-005-1779-7