An -approximation algorithm for the asymmetric maximum TSP

DOI10.1016/S0196-6774(03)00112-3zbMath1106.68120MaRDI QIDQ4819692

Markus Bläser

Publication date: 4 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Related Items (7)

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems ⋮ 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 ⋮ Three-Bar Charts Packing Problem ⋮ 35/44-approximation for asymmetric maximum TSP with triangle inequality ⋮ Maximum ATSP with weights zero and one via half-edges ⋮ An improved approximation algorithm for the maximum TSP

This page was built for publication: An -approximation algorithm for the asymmetric maximum TSP