A Linear Time Approximation Scheme for Euclidean TSP

@article{Bartal2013ALT,
  title={A Linear Time Approximation Scheme for Euclidean TSP},
  author={Y. Bartal and L. Gottlieb},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={698-706}
}
  • Y. Bartal, L. Gottlieb
  • Published 2013
  • Mathematics, Computer Science
  • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
    • The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. The special case of TSP in bounded-dimensional Euclidean spaces has been a particular focus of research: The celebrated results of Arora [Aro98] and Mitchell [Mit99] - along with subsequent improvements of Rao and Smith [RS98] - demonstrated a polynomial time approximation scheme for this problem, ultimately achieving a runtime of Od,ε(n log n). In this paper, we present a linear time approximation… CONTINUE READING
    View on IEEE
    cs.nyu.edu
    20 Citations
    Highly Influencial Citations
    1
    Background Citations
    2
    Methods Citations
    5
    Results Citations
    2
    20 Citations
    Citation Type

    Citation Type

    Euclidean Traveling Salesman Problem
    • A. Czumaj
    • Mathematics, Computer Science
    • Encyclopedia of Algorithms
    • 2016
    • 1
    A PTAS for Euclidean TSP with Hyperplane Neighborhoods
    • 4
    • PDF
    Reducing Curse of Dimensionality
    • 13
    • PDF
    Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
    • C. Chekuri, Kent Quanrud
    • Mathematics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017
    • 17
    • PDF
    Approximating the Regular Graphic TSP in Near Linear Time
    • PDF
    Maximum Scatter TSP in Doubling Metrics
    • 10
    • PDF
    Socially inspired algorithms for the travelling thief problem
    • 42
    • Highly Influenced
    • PDF
    A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
    • PDF
    Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces
    • 1
    • PDF
    A Light Metric Spanner
    • L. Gottlieb
    • Mathematics, Computer Science
    • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
    • 2015
    • 26
    • PDF

    References

    SHOWING 1-10 OF 52 REFERENCES
    The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
    • 48
    • PDF
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees
    • 3
    • PDF
    Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets
    • 3
    • PDF
    A PTAS for TSP with neighborhoods among fat regions in the plane
    • 88
    • PDF
    When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
    • L. Trevisan
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2000
    • 43
    • PDF
    Approximating TSP on metrics with bounded global growth
    • 6
    • PDF
    Approximation schemes for Euclidean k-medians and related problems
    • 364
    • PDF
    Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
    • J. Mitchell
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 1999
    • 420
    • PDF
    A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
    • 21
    • PDF
    A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
    • 97
    • PDF