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)
Handbook of combinatorics (vol. 2)
Handbook of combinatorics (vol. 2)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Two Approximation Algorithms for 3-Cycle Covers
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Journal of Discrete Algorithms
On the relationship between ATSP and the cycle cover problem
Theoretical Computer Science
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
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
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An improved approximation algorithm for TSP with distances one and two
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An O(log n) approximation ratio for the asymmetric traveling salesman path problem
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
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 factor 0.999·log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.