Performance Guarantees for the TSP with a Parameterized Triangle Inequality
We consider the approximability of the TSP problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter τ ≥ 1, the distances satisfy the inequality dist(x,y) ≤τ. (dist(x,z)+ dist(z,y)) for every triple of vertices x, y, and z. We obtain a 4τ approximation and also show that for some ∈ > 0 it is NP-hard to obtain a (1 + ∈τ) approximation. Our upper bound improves upon the earlier known ratio of (3τ 2/2/+τ/2) for all values of τ > 7/3.
KeywordsTriangle Inequality Minimum Span Tree Travel Salesman Problem Travel Salesman Problem Hamiltonian Cycle
Unable to display preview. Download preview PDF.
- 2.S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In 37th IEEE Symposium on Foundations of Computer Science, pages 2–12, 1996.Google Scholar
- 3.S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In 38th IEEE Symposium on Foundations of Computer Science, pages 554–563, 1997.Google Scholar
- 4.N. Christofides. Worst-case analysis of a new heuristic for the Traveling Salesman Problem. Technical Report 338, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.Google Scholar
- 5.L. Engebretsen. An explicit lower bound for TSP with distances one and two. Report No. 46 of the Electronic Colloquium on Computational Complexity, 1998.Google Scholar
- 9.S. Khuller. Approximation algorithms for finding highly connected subgraphs. In Approximation Algorithms for NP-hard Problems, pages 236–265. PWS Publishing Company, Boston, 1997.Google Scholar
- 11.H. T. Lau. Finding a Hamiltonian Cycle in the Square of a Block. PhD thesis, McGill University, February 1980.Google Scholar
- 14.J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: Part ii-a simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. To appear in SIAM Journal of Computing.Google Scholar
- 15.W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker. The QBIC project: querying images by content using color, texture, and shape. In Proceedings of SPIE Conference on Storage and Retrieval for Image and Video Databases, volume 1908, pages 173–181, 1993.Google Scholar
- 18.M. Penn and H. Shasha-Krupnik. Improved approximation algorithms for weighted 2 & 3 vertex connectivity augmentation problems. Technical Report TR-95-IEM/OR-1, Industrial Engineering and Management, Technion, Israel, May 1995.Google Scholar