An Improved Integrality Gap for Asymmetric TSP Paths

  title={An Improved Integrality Gap for Asymmetric TSP Paths},
  author={Zachary Friggstad and A. Gupta and M. Singh},
  • Zachary Friggstad, A. Gupta, M. Singh
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V,d) with specified vertices s and t, the goal is to find an s-t path of minimum length that visits all the vertices in V. This problem is closely related to the Asymmetric TSP (ATSP) problem, which seeks to find a tour (instead of an s-t path) visiting all the nodes: for ATSP, a ρ-approximation guarantee implies an O(ρ)-approximation for ATSPP. However, no such connection is known for… CONTINUE READING
    5 Citations
    Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem
    • Thomas Watson
    • Computer Science, Mathematics
    • Chic. J. Theor. Comput. Sci.
    • 2014
    • 3
    • PDF
    Multiple Traveling Salesmen in Asymmetric Metrics
    • 4
    • PDF


    An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
    • 10
    • PDF
    Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
    • 74
    • PDF
    Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
    • 30
    • PDF
    Eight-Fifth Approximation for the Path TSP
    • 33
    • PDF
    The Directed Minimum Latency Problem
    • 23
    • PDF
    Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
    • 5
    • PDF
    Improving Christofides' Algorithm for the s-t Path TSP
    • 52
    • Highly Influential
    • PDF
    Eight-Fifth approximation for the path TSP
    • A. Sebő
    • Mathematics, Computer Science
    • IPCO 2013
    • 2013
    • 34
    • PDF
    Asymmetric traveling salesman path and directed latency problems
    • 16
    • PDF