On Approximation Lower Bounds for TSP with Bounded Metrics
@article{Karpinski2012OnAL,
title={On Approximation Lower Bounds for TSP with Bounded Metrics},
author={M. Karpinski and R. Schmied},
journal={Electron. Colloquium Comput. Complex.},
year={2012},
volume={19},
pages={8}
}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.Â
Figures and Topics from this paper
Figures
figure 1 
figure 2 
figure 3 
figure 4 
figure 5 
figure 6 
figure 7 
figure 8 
figure 9 
figure 10 
figure 11 
figure 12 
figure 13 
figure 14 
figure 15 
figure 16 
figure 17 
figure 18 
figure 19 
figure 20 
figure 21 
figure 22 
figure 23 
figure 24 
figure 25 
figure 26 
figure 27 
figure 28 
figure 29 
figure 30 
figure 31 
figure 32 
figure 33 
figure 34 
figure 35 
figure 36 
figure 37 
figure 38 
figure 39 
figure 40 
figure 41 
figure 42 
figure 43 
figure 44 
figure 45 
figure 46 
figure 47 
figure 48 
figure 49 
figure 50 
figure 51 
figure 52 
figure 53 
figure 54 
figure 55
Paper Mentions
18 Citations
Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies
- Computer Science
- FCT
- 2015
- 1
- PDF
Approximation hardness of graphic TSP on cubic graphs
- Mathematics, Computer Science
- RAIRO Oper. Res.
- 2013
- 12
- PDF
Improved Inapproximability Results for the Shortest Superstring and Related Problems
- Computer Science, Mathematics
- CATS
- 2013
- 20
- PDF
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2018
- 4
Improved integrality gap upper bounds for TSP with distances one and two
- Computer Science, Mathematics
- ArXiv
- 2013
- 3
- PDF
On Approximability of Bounded Degree Instances of Selected Optimization Problems
- Computer Science
- 2013
- PDF
References
SHOWING 1-10 OF 29 REFERENCES
Improved lower bounds on the approximability of the Traveling Salesman Problem
- Mathematics, Computer Science
- RAIRO Theor. Informatics Appl.
- 2000
- 37
- PDF
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
- Computer Science, Mathematics
- SODA
- 2010
- 125
- PDF
The Traveling Salesman Problem with Distances One and Two
- Mathematics, Computer Science
- Math. Oper. Res.
- 1993
- 419
Improved Lower Bounds for the Shortest Superstring and Related Problems
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2011
- 6
- PDF
On Some Tighter Inapproximability Results
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 1998
- 260
An Explicit Lower Bound for TSP with Distances One and Two
- Mathematics, Computer Science
- Algorithmica
- 2002
- 31
Improved Inapproximability for TSP
- Computer Science, Mathematics
- APPROX-RANDOM
- 2012
- 19
- Highly Influential
- PDF