Constant Factor Approximation for ATSP with Two Edge Weights

(Extended Abstract)
  • Ola Svensson
  • Jakub Tarnawski
  • László A. Végh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9682)

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.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ola Svensson
    • 1
  • Jakub Tarnawski
    • 1
  • László A. Végh
    • 2
  1. 1.École Polytechnique Fédérale de LausanneLausanneSwitzerland
  2. 2.London School of EconomicsLondonUK

Personalised recommendations