An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Information Processing Letters
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
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Linear Time Approximation Schemes for Vehicle Scheduling
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Journal of Computer and System Sciences
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Taxi pick-ups route optimization using genetic algorithms
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Short witnesses and accepting lassos in ω-automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
When the greedy algorithm fails
Discrete Optimization
| Hi-index | 0.00 |
The general asymmetric (and metric) TSP is known to be approximable only to within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 101/100 and 203/202, respectively, for these problems. We prove also approximation lower bounds of 321/320 and 743/742 for the asymmetric and symmetric TSP with distances one and two.