Recognition: unknown
On Approximation Lower Bounds for TSP with Bounded Metrics
classification
💻 cs.CC
cs.DMcs.DS
keywords
boundsbestboundedknownlowermetricsapproximationbound
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.