Abstract
We give a constant factor \( (\frac{\gamma } {{1 - \gamma }} + \gamma ) \) approximation for the asymmetric traveling salesman problem in graphs with costs on the edges satisfying γ-parametrized triangle inequality (γ-Asymmetric graphs) for γ ∈ [ 1/2 , 1). We also give an improvement of the algorithm with approximation factor approaching \( \frac{\gamma } {{1 - \gamma }} \).
We also explore the \( \frac{{c_{max} }} {{c_{min} }} \) ratio of edge costs in a general asymmetric graph. We show that for γ ∈ \( [\frac{1} {2},\frac{1} {{\sqrt 3 }}), \frac{{c_{max} }} {{c_{min} }} \leqslant \frac{{2\gamma ^3 }} {{1 - 3\gamma ^2 }} \) , while for γ ∈ \( [\frac{1} {{\sqrt 3 }},1) \), this ratio can be arbitrarily large. We make use of this result to give a better analysis to our main algorithm. We also observe that when \( \frac{{c_{max} }} {{c_{min} }} > \frac{{\gamma ^2 }} {{1 - \gamma - \gamma ^2 }} \) with γ ∈ \( (\frac{1} {2},\frac{{\sqrt 5 - 1}} {2}) \), the minimum cost and the maximum cost edges in the graph are uniqueand are reverse to each other.
Dept. of Computer Science and Automation, Indian Institute of Science, Bangalore, India 560012. This research is partially supported by Infosys fellowship
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Andreae, J. Bandelt, Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discrete Math 8, 1995, pp1–16.
M.A. Bender and C. Chekuri, Performance guarantees for the TSP with a parametrized triangle inequality. Proc.WADS’99, LNCS 1663, Springer 1999, pp80–85.
J. Bockenhauer, J. Hromkovic, R. Klasing, S. Seibert and W. Unger, An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality. Proc. STACS’00, LNCS, Springer, Berlin, 2000.
N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep, GSIA, Carnegie Mellon University, 1976.
W. Cook et al., Combinatorial Optimization. John Wiley & Sons, Inc., 1998.
J. Edmonds, L. Johnson, Matching: A well-solved class of integer linear programs. Proc. Calgary International conference on combinatorial structures and their applications, Gordon and Breach, 1970, pp89–92.
A. Frieze, G. Galbiati and F. Maffioli, On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23–39, 1982.
C. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two. Math. of Operations Research, Vol. 18, 1–11, 1993.
Sundar Vishwanathan, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Information Processing Letters, 44(6), 297–302, 1992.
S. Vempala and R. Carr, Towards a 4/3 approximation for the asymmetric TSP. Proc. SODA’00.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandran, L.S., Ram, L.S. (2002). Approximations for ATSP with Parametrized Triangle Inequality. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive