An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 382-394

  Böckenhauer, Hans Joachim ^a   HromkoviČ, Juraj ^a   Klasing, Ralf ^a   Seibert, Sebastian ^a   Unger, Walter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Traveling salesman problem

Indexed keywords

POLYNOMIAL APPROXIMATION; TRAVELING SALESMAN PROBLEM;

APPROXIMABILITY; APPROXIMATION RATIOS; LOWER BOUNDS; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 84944033698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_32     Document Type: Conference Paper

References (15)

1. S. Arora: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems. J. ACM 45(5), 1998, pp. 753-782.
2. S. Arora: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 38th IEEE FOCS, 1997, pp. 554-563.
3. T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discr. Math. 8 (1995), pp. 1-16.
4. M. A. Bender, C. Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. In: Proc. WADS'99, LNCS 1663, Springer 1999, pp. 80-85.
5. H.-J. Böckenhauer, J. Hromković, R. Klasing, S. Seibert, W. Unger: Towards the Notion of Stability of Approximation Algorithms and the Traveling Salesman Problem. Extended abstract in: Proc. CIAC 2000, LNCS, to appear. Full version in: Electronic Colloquium on Computational Complexity, Report No. 31 (1999).
6. P. Berman, M. Karpinski: On some tighter inapproximability results. Technical Report TR98-029, Electronic Colloquium on Computational Complexity, 1998.
7. N. Christofides: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1976.
8. L. Engebretsen: An explicit lower bound for TSP with distances one and two. Extended abstract in: Proc. STACS'99, LNCS 1563, Springer 1999, pp. 373-382. Full version in: Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 46 (1999).
9. J. Edmonds, E. L. Johnson: Matching: A Well-Solved Class of Integer Linear Programs. In: Proc. Calgary International Conference on Combinatorial Structures and Their Applications, Gordon and Breach 1970, pp. 89-92.
10. H. N. Gabov, R. E. Tarjan: Faster Scaling Algorithms for General Graph- Matching Problems. In: J. ACM 38 (4), 1991, pp. 815-853.
11. D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Company 1996.
12. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (Eds.): The Traveling Salesman Problem. John Wiley & Sons, 1985.
13. I. S. B. Mitchell: Guillotine subdivisions approximate polygonal subdivisions: Part II-a simple polynomial-time approximation scheme for geometric k- MST, TSP and related problems. Technical Report, Dept. of Applied Mathematics and Statistics, Stony Brook 1996.
14. E. W. Mayr, H. J. Prömel, A. Steger (Eds.): Lectures on Proof Verification and Approximation Algorithms. LNCS 1967, Springer 1998.
15. Ch. Papadimitriou, M. Yannakakis: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993), 1-11.