Improved deterministic approximation algorithms for Max TSP

Information Processing Letters

Volumn 95, Issue 2, 2005, Pages 333-342

  Chen, Zhi Zhong ^a   Okamoto, Yuusuke ^a   Wang, Lusheng ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithms; Graph algorithms; Randomized algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPHIC METHODS; HAMILTONIANS; POLYNOMIALS; PROBABILITY;

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; MAXIMUM TRAVELING SALESMAN PROBLEM (MAX TSP); RANDOMIZED ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 20444467740     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.03.011     Document Type: Article

References (10)

1. A.I. Barvinok, D.S. Johnson, G.J. Woeginger, and R. Woodroofe Finding maximum length tours under polyhedral norms Proc. 6th Internat. Conf. Integer Programming and Combinatorial Optimization (IPCO) Lecture Notes in Comput. Sci. vol. 1412 1998 Springer Berlin 195 201
2. Z.-Z. Chen Parallel constructions of maximal path sets and applications to short superstrings Theoret. Comput. Sci. 161 1996 1 21
3. Z.-Z. Chen, L. Wang, An improved randomized approximation algorithm for Max TSP, submitted for publication
4. R. Hassin, and S. Rubinstein An approximation algorithm for the maximum traveling salesman problem Inform. Process. Lett. 67 1998 125 130
5. R. Hassin, and S. Rubinstein Better approximations for Max TSP Inform. Process. Lett. 75 2000 181 186
6. R. Hassin, and S. Rubinstein A 7/8-approximation approximations for metric Max TSP Inform. Process. Lett. 81 2002 247 251
7. R.M. Karp, E. Upfal, and A. Wigderson Constructing a perfect matching is in random NC Combinatorica 6 1986 35 48
8. A.V. Kostochka, and A.I. Serdyukov Polynomial algorithms with the estimates 3 4 and 5 6 for the traveling salesman problem of maximum Upravlyaemye Sistemy 26 1985 55 59 (in Russian)
9. K. Mulmuley, U.V. Vazirani, and V.V. Vazirani Matching is as easy as matrix inversion Combinatorica 7 1987 105 113
10. A.I. Serdyukov An algorithm with an estimate for the traveling salesman problem of maximum Upravlyaemye Sistemy 25 1984 80 86 (in Russian)