Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
SIAM Journal on Discrete Mathematics
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved integrality gap for asymmetric TSP paths
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We present a polynomial time factor 0.999 ċ log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.