A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Approximation algorithms for the shortest common superstring problem
Information and Computation
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Better approximations for max TSP
Information Processing Letters
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for the maximum TSP
Theoretical Computer Science
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters
Hi-index | 0.00 |
We present a polynomial time approximation algorithm for the asymmetric maximum traveling salesperson problem that achieves performance ratio 8/13 (1 - 1/n). The running time of our algorithm is O(n3).