On Approximation Lower Bounds for TSP with Bounded Metrics

@article{Karpinski2012OnAL,
  title={On Approximation Lower Bounds for TSP with Bounded Metrics},
  author={Marek Karpinski and Richard Schmied},
  journal={ArXiv},
  year={2012},
  volume={abs/1201.5821}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Proceedings 13 Volume Editors

VIEW 12 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

  • Lecture Notes in Computer Science
  • 2001
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED