The traveling salesman problem with distances one and two
Mathematics of Operations Research
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On Some Tighter Inapproximability Results, Further Improvements
On Some Tighter Inapproximability Results, Further Improvements
On Approximation Hardness of Dense TSP and other Path Problems
On Approximation Hardness of Dense TSP and other Path Problems
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for time-dependent orienteering
Information Processing Letters
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Web Searching Using Temporal Factors
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Radio Labeling with Pre-assigned Frequencies
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A general framework for coloring problems: old results, new results, and open problems
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
| Hi-index | 0.00 |
We show that it is NP-hard to approximate the traveling salesman problem with distances one and two within 5381=5380-Ɛ, for any Ɛ 0. Our proof is a reduction from systems of linear equations mod 2 with two unknowns in each equation and at most three occurrences of each variable.