Approximations for ATSP with parametrized triangle inequality

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

Volumn 2285, Issue , 2002, Pages 227-237

  Sunil Chandran, L ^a   Shankar Ram, L ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; TRAVELING SALESMAN PROBLEM;

APPROXIMATION FACTOR; ASYMMETRIC TRAVELING SALESMAN PROBLEM; CONSTANT FACTORS; EDGE COSTS; MINIMUM COST; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 84937433009     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. T. Andreae, J. Bandelt, Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM J. Discrete Math 8, 1995, pp1-16.
2. 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.
3. 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.
4. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep, GSIA, Carnegie Mellon University, 1976.
5. W. Cook et al., Combinatorial Optimization. John Wiley & Sons, Inc., 1998.
6. 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.
7. 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.
8. C. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two. Math. of Operations Research, Vol. 18, 1-11, 1993.
9. Sundar Vishwanathan, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Information Processing Letters, 44(6), 297-302, 1992.
10. S. Vempala and R. Carr, Towards a 4/3 approximation for the asymmetric TSP. Proc. SODA’00.