The traveling salesman problem: Low-dimensionality implies a polynomial time approximation scheme

Keyphrases

• Traveling Salesman Problem 100%
• Polynomial-time Approximation Scheme 100%
• Low Dimensionality 100%
• Theory of Computing 25%
• Metric Space 25%
• Polynomial Time 25%
• Euclidean Space 25%
• Intrinsic Dimension 25%
• Problem Instances 25%
• Tractability 25%
• Quasi-polynomial Time Algorithms 25%
• Metric Travelling Salesman Problem 25%
• NP-hard Optimization Problem 25%
• Optimal Tour 25%

Mathematics

• Polynomial Time 100%
• Traveling Salesman Problem 100%
• Metric Space 20%
• Dimensional Euclidean Space 20%