A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.

• Type: Conference
• Year: 2004
• Where: APPROX
• Authors: Markus Bläser
• Keywords: 3/4-approximation Algorithm, Algorithms, APPROX 2004, Asymmetric Tsp, Maximum Asymmetric Tsp