a new approximation algorithm for the asymmetric tsp with triangle inequality
We present a polynomial time factor 0.999log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.
approximation algorithm tsp traveling salesman problem cycle cover