The traveling salesman problem with distances one and two
Mathematics of Operations Research
Rotations of periodic strings and short superstrings
Journal of Algorithms
Approximating Capacitated Routing and Delivery Problems
SIAM Journal on Computing
Approximation algorithms
A 7/8-approximation algorithm for metric Max TSP
Information Processing Letters
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Two Approximation Algorithms for 3-Cycle Covers
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
SIAM Journal on Discrete Mathematics
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Long tours and short superstrings
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
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
Improved approximation algorithms for metric max TSP
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We consider an APX-hard variant (@D-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 3140-approximation algorithm for @D-Max-ATSP and a 34-approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems.