35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality

We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 31/40 factor of Bl¨aser, Ram and Sviridenko [1]. Keywords. Traveling salesman problem, asymmetric, maximum, triangle inequality, approximation, algorithm.

• Type: Conference
• Year: 2007
• Where: WADS
• Authors: Lukasz Kowalik, Marcin Mucha
• Keywords: Algorithm Achieves Approximation, Algorithms, Traveling Salesman Problem, Triangle Inequality, WADS 2007