2000 character limit reached
On Approximation Lower Bounds for TSP with Bounded Metrics (1201.5821v2)
Published 27 Jan 2012 in cs.CC, cs.DM, and cs.DS
Abstract: 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.