On Approximation Lower Bounds for TSP with Bounded Metrics
Computational Complexity
2012-08-09 v2 Discrete Mathematics
Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1201.5821,
title = {On Approximation Lower Bounds for TSP with Bounded Metrics},
author = {Marek Karpinski and Richard Schmied},
journal= {arXiv preprint arXiv:1201.5821},
year = {2012}
}