Sciweavers

APPROX
2004
Springer

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

14 years 4 months ago
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.
Markus Bläser
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where APPROX
Authors Markus Bläser
Comments (0)