An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

Journal of Discrete Algorithms

Volumn 4, Issue 4, 2006, Pages 623-632

  Bläser, Markus ^a   Manthey, Bodo ^b   Sgall, Jiří ^c  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF LÜBECK   (Germany)

^c MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Strengthened triangle inequality; Traveling Salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

STRENGTHENED TRIANGLE INEQUALITY;

TRAVELING SALESMAN PROBLEM;

EID: 33751078063     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.07.004     Document Type: Article

References (12)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice-Hall, Englewood Cliffs, NJ
2. Andreae T. On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38 2 (2001) 59-67
3. Andreae T., and Bandelt H.-J. Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM J. Discrete Math. 8 1 (1995) 1-16
4. Bender M.A., and Chekuri C. Performance guarantees for the TSP with a parameterized triangle inequality. Proc. 6th Int. Workshop on Algorithms and Data Structures (WADS). Lecture Notes in Comput. Sci. vol. 1663 (1999), Springer, Berlin 80-85
5. Bläser M. A new approximation algorithm for asymmetric TSP with triangle inequality. Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2003) 639-647
6. Bläser M. An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Proc. 30th Int. Coll. on Automata, Languages, and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 2719 (2003), Springer, Berlin 157-163
7. Böckenhauer H.-J., Hromkovič J., Klasing R., Seibert S., and Unger W. Approximation algorithms for the TSP with sharpened triangle inequality. Inform. Process. Lett. 75 3 (2000) 133-138
8. Böckenhauer H.-J., Hromkovič J., Klasing R., Seibert S., and Unger W. Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoret. Comput. Sci. 285 1 (2002) 3-24
9. Chandran L.S., and Ram L.S. Approximations for ATSP with parametrized triangle inequality. Proc. 19th Int. Symp. on Theoret. Aspects of Comput. Sci. (STACS). Lecture Notes in Comput. Sci. vol. 2285 (2002), Springer, Berlin 227-237
10. Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. In: Traub J.F. (Ed). Algorithms and Complexity: New Directions and Recent Results (1976), Academic Press, New York 441
11. Frieze A.M., Galbiati G., and Maffioli F. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 1 (1982) 23-39
12. Kaplan H., Lewenstein M., Shafrir N., and Sviridenko M. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Proc. 44th IEEE Symp. on Foundations of Comput. Sci. (FOCS) (2003) 56-65