An -approximation algorithm for the asymmetric maximum TSP
From MaRDI portal
Publication:4819692
DOI10.1016/S0196-6774(03)00112-3zbMath1106.68120MaRDI QIDQ4819692
Publication date: 4 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items
A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem, An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem, 35/44-approximation for asymmetric maximum TSP with triangle inequality, Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems, An improved approximation algorithm for the maximum TSP, Maximum ATSP with weights zero and one via half-edges