Worst case performance of an approximation algorithm for asymmetric TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 465-476

  Palbom, Anna ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CONSTANT FACTORS; OPTIMUM SOLUTION; TRIANGLE INEQUALITY; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS;

EID: 33846193855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_41     Document Type: Article

References (9)

1. Markus Bläser A new approximation algorithm for the asymmetric TSP with triangle inequality Proceedings 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 6387-645, 2003.
2. Nicos Christofides Worst case analysis of a new heuristic for the traveling salesman problem Tech. Rep. 388, GSIA, Carnegie Mellon Univerity, 1976.
3. Alan M. Frieze, Giulia Galbiati and Francesco Maffioli On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem Networks 12:23-39, 1982.
4. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko Approximation algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs Proceedings of Symposium on Foundations of Computer Science (FOCS),56-65, 2003.
5. Richard M. Karp Reducibility among combinatorial problems In Raymond E Miller and James W Thatcher, editors, Complexity of Computer Computations 85-103, Plenum Press, New York, 1972.
6. Richard M. Karp The fast approximate solution of hard combinatorial problems Proceedings 6th South Eastern Conference on Combinatorics, Graph Theory and Computing 15-21, Utilitas Mathematica, Winnipeg, 1975.
7. Christos H. Papadimitriou and Santosh Vempala On the approximability of the traveling salesman problem Manuscript May 2002. http://www.cs.berkeley.edu/ ~christos/tsp.ps
8. Sartaj K. Sahni and Teofilo Gonzalez P-complete approximation problems Journal of the Assoc. Comput. Mach. 23, 3, 555-565, 1976.
9. Günter Schaar Remarks on Hamiltonian properties of powers of digraphs Discrete Applied Mathematics 51:181-186, 1994.