Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 2012 Copyright 2012 Universität Bonn, Institut für Informatik, Abt. V
85325

27.01.2012

On Approximation Lower Bounds for TSP with Bounded Metrics
Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF]

We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In particular, we prove the best known lower bound for TSP with bounded metrics for the metric bound equal to 4.

Last Change: 11/05/14 at 11:01:16
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope