On the complexity of Katamari Damacy
Crossroads
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating the Metric TSP in Linear Time
Graph-Theoretic Concepts in Computer Science
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Structural properties of hard metric TSP inputs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Spanning closed walks and TSP in 3-connected planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation hardness of min-max tree covers
Operations Research Letters
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
TSP tours in cubic graphs: beyond 4/3
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
On integrality ratios for asymmetric TSP in the sherali-adams hierarchy
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than $$\frac{{117}}{{116}}$$ when the edge lengths are allowed to be asymmetric and $$\frac{{220}}{{219}}$$ when the edge lengths are symmetric, unless P=NP. The best previous lower bounds were $$\frac{{2805}}{{2804}}$$ and $$\frac{{3813}}{{3812}}$$ respectively. The reduction is from Håstad’s maximum satisfiability of linear equations modulo 2, and is nonconstructive.