While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...