Ario Salmasi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In the Asymmetric Traveling Salesperson Problem (ATSP) the goal is to find a closed walk of minimum cost in a directed graph visiting every vertex. We consider the approximability of ATSP on topologically restricted graphs. It has been shown by Oveis Gharan and Saberi [14] that there exists polynomial-time constant-factor approximations on planar graphs and(More)
  • 1