An improved randomized approximation algorithm for max TSP

Journal of Combinatorial Optimization

Volumn 9, Issue 4, 2005, Pages 401-432

  Chen, Zhi Zhong ^a   Wang, Lusheng ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithms; Graph algorithms; Max TSP; Randomized algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY;

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; MAX TSP;

TRAVELING SALESMAN PROBLEM;

EID: 23944508242     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10878-005-1779-7     Document Type: Article

References (7)

1. A.I. Barvinok, D.S. Johnson, G.J. Woeginger, and R. Woodroofe, "Finding maximum length tours under polyhedral norms," Proceedings of the Sixth International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 1412, pp. 195-201, 1998.
2. P. Chalasani and R. Motwani, "Approximating capacitated routing and delivery problems," SIAM Journal on Computing, vol. 28, pp. 2133-2149, 1999.
3. R. Hassin and S. Rubinstein, "An approximation algorithm for the maximum traveling salesman problem," Information Processing Letters, vol. 67, pp. 125-130, 1998.
4. R. Hassin and S. Rubinstein, "Better approximations for max TSP," Information Processing Letters, vol. 75, pp. 181-186, 2000.
5. R. Hassin and S. Rubinstein, "A 7/8-approximation approximations for metric max TSP," Information Processing Letters, vol. 81, pp. 247-251, 2002.
6. A.V. Kostochka and A.I. Serdyukov, "Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of maximum (in Russian)," Upravlyaemye Sistemy, vol. 26, pp. 55-59, 1985.
7. A.I. Serdyukov, "An algorithm with an estimate for the traveling salesman problem of maximum (in Russian)," Upravlyaemye Sistemy, vol. 25, pp. 80-86, 1984.