Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract)

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was given recently in [Sve15]. This was accomplished by introducing an easier problem called Local-Connectivity… CONTINUE READING