Worst case performance of an approximation algorithm for asymmetric TSP
2004 (English)In: STACS 2004, PROCEEDINGS, BERLIN: SPRINGER , 2004, Vol. 2996, 465-476 p.Conference paper (Refereed)
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 log(2) n. We construct a family of graphs for which the algorithm (with some implementation details specified by us) gives an approximation which is log(2) n/(2 + 2epsilon) 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.
Place, publisher, year, edition, pages
BERLIN: SPRINGER , 2004. Vol. 2996, 465-476 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 2996
IdentifiersURN: urn:nbn:se:kth:diva-43981ISI: 000189497100041ScopusID: 2-s2.0-33846193855ISBN: 3-540-21236-1OAI: oai:DiVA.org:kth-43981DiVA: diva2:450879
21st Annual Symposium on Theoretical Aspects of Computer Science. Montpellier, FRANCE. MAR 25-27, 2004
QC 201110242011-10-242011-10-192011-10-24Bibliographically approved