A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
From MaRDI portal
Publication:4443134
DOI10.1137/S0895480102402861zbMath1091.68123MaRDI QIDQ4443134
M. I. Sviridenko, Moshe Lewenstein
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (4)
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems ⋮ An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ 35/44-approximation for asymmetric maximum TSP with triangle inequality ⋮ Maximum ATSP with weights zero and one via half-edges
This page was built for publication: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP