Abstract
In 1982 Frieze, Galbiati and Maffioli (Networks 12:23-39) published their famous algorithm for approximating the TSP tour in an asymmetric graph with triangle inequality. They show that the algorithm approximates the TSP tour within a factor of log2 n. We construct a family of graphs for which the algorithm (with some implementation details specified by us) gives an approximation which is log2 n / (2 + 2ε) times the optimum solution. This shows that the analysis by Frieze et al. is tight up to a constant factor and can hopefully give deeper understanding of the problem and new ideas in developing an improved approximation algorithm.
Keywords
- Distance Function
- Approximation Algorithm
- Triangle Inequality
- Travelling Salesman Problem
- Travel Salesman Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bläser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. In: Proceedings 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 638–645 (2003)
Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem Tech. Rep. 388, GSIA, Carnegie Mellon Univerity (1976)
Frieze, A.M., Galbiati, G., Maffioli, F.: On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem. Network 12, 23–39 (1982)
Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proceedings of Symposium on Foundations of Computer Science (FOCS), pp. 56–65 (2003)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Karp, R.M.: The fast approximate solution of hard combinatorial problems. In: Proceedings 6th South Eastern Conference on Combinatorics, Graph Theory and Computing, pp. 15–21, Utilitas Mathematica, Winnipeg (1975)
Papadimitriou, C.H., Vempala, S.: On the approximability of the traveling salesman problem (manuscript) (May 2002), http://www.cs.berkeley.edu/~christos/tsp.ps
Sahni, S.K., Gonzalez, T.: P-complete approximation problems. Journal of the Assoc. Comput. Mach. 23(3), 555–565 (1976)
Schaar, G.: Remarks on Hamiltonian properties of powers of digraphs. Discrete Applied Mathematics 51, 181–186 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palbom, A. (2004). Worst Case Performance of an Approximation Algorithm for Asymmetric TSP. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive