An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Authors:
- Markus BläserMBMarkus Bläser
- Bodo MantheyBMBodo Manthey
- Jiří SgallJSJiří Sgall
- 1 December 2006
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 4 (4) , 623-632
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problemTheoretical Computer Science, 2002
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequalityNetworks, 2001
- Approximation algorithms for the TSP with sharpened triangle inequalityInformation Processing Letters, 2000
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle InequalitiesSIAM Journal on Discrete Mathematics, 1995
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982