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
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
On the approximation hardness of dense TSP and other path problems
Information Processing Letters
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An improved approximation algorithm for TSP with distances one and two
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Journal of Computer and System Sciences
Approximation results for the weighted P4 partition problem
Journal of Discrete Algorithms
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms (TALG)
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
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Discrete Applied Mathematics
An approximation algorithm for a bottleneck traveling salesman problem
Journal of Discrete Algorithms
Facet detection and visualizing local structure in graphs
GVE '07 Proceedings of the IASTED International Conference on Graphics and Visualization in Engineering
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
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
TSP on cubic and subcubic graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Method of scaling in approximate solution of the traveling salesman problem
Automation and Remote Control
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
On the integrality gap of the subtour LP for the 1,2-TSP
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Approximating the maximum sharing problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
We design a polynomial time 8/7-approximation algorithm for the Traveling Salesman Problem in which all distances are either one or two. This improves over the best known approximation factor for that problem. As a direct application we get a 7/6-approximation algorithm for the Maximum Path Cover Problem, similarly improving upon the best known approximation factor for that problem. The result depends on a new method of consecutive path cover improvements and on a new analysis of certain related color alternating paths. This method could be of independent interest.