|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-APX-Reports 2012 | Copyright 2012 University of Bonn, Department of Computer Science, Abt. V | |
|
89134 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
|
University of Bonn -> Department of Computer Science -> Chair V | |