Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2013 Copyright 2013 University of Bonn, Department of Computer Science, Abt. V
85344

03.09.2013

Approximation Taxonomy of Metric TSP

[Download PostScript] [Download PDF]

The list below presents the best up to now known upper and lower approximation bounds for the instances of metric TSP (we refer also to another source on approximation algorithms for metric TSP [8]). It is intended to codify (at one glance) the (many) recent developments and improvements on the approximability of that problem. It is hoped to be useful in further research on the possible improvements of the underlying approximation bounds.

Last Change: 11/05/14 at 11:02:19
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V