Better approximations for max TSP

Information Processing Letters

Volumn 75, Issue 4, 2000, Pages 181-186

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS;

SERDYUKOV'S ALGORITHM;

TRAVELING SALESMAN PROBLEM;

EID: 0034272886     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00097-1     Document Type: Article

References (5)

1. Barvinok A.I., Johnson D.S., Woeginger G.J., Woodroofe R. Finding maximum length tours under polyhedral norms. Proceedings of IPCO VI. Lecture Notes in Computer Science. Vol. 1412:1998;195-201.
2. Chalasani P., Motwani R. Approximating capacitated routing and delivery problems. SIAM J. Comput. Vol. 28:1999;2133-2149.
3. Hassin R., Rubinstein S. An approximation algorithm for the maximum traveling salesman problem. Inform. Process. Lett. Vol. 67:1998;125-130.
4. Kostochka A.V., Serdyukov A.I. Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum. Upravlyaemye Sistemy. Vol. 26:1985;55-59. (in Russian).
5. Serdyukov A.I. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy. Vol. 25:1984;80-86. (in Russian).