A -approximation algorithm for metric Max TSP
References (7)
- et al.
Better approximations for Max TSP
Inform. Process. Lett.
(2000) - et al.
Finding maximum length tours under polyhedral norms
- A. Barvinok, E.Kh. Gimadi, A.I. Serdyukov, The maximum traveling salesman problem, in: G. Gutin, A. Punnen (Eds.), The...
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2002 Elsevier Science B.V. All rights reserved.