On Approximation Lower Bounds for TSP with Bounded Metrics

Details On Approximation Lower Bounds for TSP with Bounded Metrics On Approximation Lower Bounds for TSP with Bounded Metrics

2012-01-27

arxiv.org/abs/1201.5821v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Approximation Lower Bounds for TSP with Bounded Metrics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Approximation Lower Bounds for TSP with Bounded Metrics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Approximation Lower Bounds for TSP with Bounded Metrics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345234