Abstract
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)[1] for all values of τ > 7/3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Andreae and H.-S. Bandelt. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal of Discrete Mathematics, 8(1):1–16, February 1995.
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.
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.
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.
L. Engebretsen. An explicit lower bound for TSP with distances one and two. Report No. 46 of the Electronic Colloquium on Computational Complexity, 1998.
R. Fagin and L. Stockmeyer. Relaxing the triangle inequality in pattern matching. International Journal of Computer Vision, 30(3):219–231, 1998.
H. Fleischner. On spanning subgraphs of a connected bridgeless graph and their application to DT graphs. Journal of Combinatorial Theory, 16:17–28, 1974.
H. Fleischner. The square of every two-connected graph is Hamiltonian. Journal of Combinatorial Theory, 16:29–34, 1974.
S. Khuller. Approximation algorithms for finding highly connected subgraphs. In Approximation Algorithms for NP-hard Problems, pages 236–265. PWS Publishing Company, Boston, 1997.
S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms, 21:434–450, 1996.
H. T. Lau. Finding a Hamiltonian Cycle in the Square of a Block. PhD thesis, McGill University, February 1980.
H. T. Lau. Finding EPS-graphs. Monatshefte für Mathematik, 92:37–40, 1981.
E. L. Lawler, J. K. Lenstra, A. H. G. RinnooyKan, and D. B. Shmoys. The Traveling Salesman Problem. John Wiley, New York, 1985.
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.
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.
C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1):1–16, February 1993.
R. GaryParker and Ronald L. Rardin. Guaranteed performance heuristics for the bottleneck traveling salesman problem. Operations Research Letters, 2(6):269–272, 1984.
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.
M. Sekanina. On an ordering of the set of vertices of a connected graph. Publication of the Faculty of Sciences of the University of Brno, 412:137–142, 1960.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bender, M.A., Chekuri, C. (1999). Performance Guarantees for the TSP with a Parameterized Triangle Inequality. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive