Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics
A new approximation algorithm for the asymmetric TSP with triangle inequality
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 ATSP with Strengthened Triangle Inequality
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
| Hi-index | 0.00 |
We consider the asymmetric traveling salesperson problem with γ-parameterized triangle inequality for γ ∈ (1/2, 1). That means, the edge weights fulfill w(u, v) ≤ γ ċ (w(u, x) + w(x, v)) for all nodes u, v, x. Chandran and Ram [6] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio γ/1-γ. We devise an approximation algorithm with performance ratio 1/1-1/2(γ+γ3), which is better than the one by Chandran and Ram for γ ∈ (0.6507, 1), that is, for the particularly interesting large values of γ.