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 [17]. This was accomplished by introducing an easier problem called Local-Connectivity ATSP and showing that a good solution to this problem can be used to obtain a constant factor approximation for ATSP. In this paper, we solve Local-Connectivity ATSP for two different edge weights. The solution is based on a flow decomposition theorem for solutions of the Held-Karp relaxation, which may be of independent interest.
Cite
CITATION STYLE
Svensson, O., Tarnawski, J., & Végh, L. A. (2016). Constant factor approximation for ATSP with two edge weights. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9682, pp. 226–237). Springer Verlag. https://doi.org/10.1007/978-3-319-33461-5_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
