A new approximation algorithm for the asymmetric TSP with triangle inequality

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 638-645

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; LINEAR PROGRAMMING; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

ASYMMETRIC TRAVELING SALESPERSON PROBLEM; TRIANGLE INEQUALITY;

ALGORITHMS;

EID: 0038416006     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. Markus Bläser and Bodo Manthey. Two approximation algorithms for 3-cycle covers. In Proc. 5th Int. Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), volume 2462 of Lecture Notes in Comput. Sci., pages 40-50. Springer, 2002.
3. Markus Bläser and Bodo Sieber. Computing cycle covers without short cycles. In Proc. 9th Ann. European Symp. on Algorithms (ESA), volume 2161 of Lecture Notes in Comput. Sci., pages 368-379. Springer, 2001.
4. J. Böckenhauer, J. Hromkovič, 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. In Proc. 17th Int. Symp. on Theoret. Aspects of Comput. Sci. (STACS), volume 1770 of Lecture Notes in Comput. Sci., pages 382-394. Springer 2000.
5. Robert Carr and Santosh Vempala. Towards a 4/3 approximation for the asymmetric traveling salesman problem. In Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 116-125, 2000.
6. L. Sunil Chandran and L. Shankar Ram. Approximations for ATSP with parametrized triangle inequality. In Proc. 19th Int. Symp. on Theoret. Aspects of Comput. Sci. (STACS), volume 2285 of Lecture Notes in Comput. Sci., pages 227-237, 2002.
7. Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, page 441. Academic Press, 1976.
8. Uri Feige. A threshold of ln n for approximating set cover. J. ACM, 45:634-652, 1998.
9. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(1):23-39, 1982.
10. R. L. Garham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics, volume II. Elvsevier, 1995.
11. R. L. Graham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics, volume I. Elvsevier, 1995.
12. Michael Held and Richard M. Karp. The travelling salesman problem and minimum spanning trees. Operations Research, 18:1138-1162, 1970.
13. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci, 9:256-278, 1974.
14. David S. Johnson, Gregory Gutin, Lyle A. McGeoch, Anders Yeo, Weixiong Zhang, and Alexei Zverovitch. Experimental analysis of heuristics for the ATSP. In G. Gutin and A. P. Punnen, editors, The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, 2002.
15. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. Wiley, 1985.
16. Moshe Lewenstein and Maxim Sviridenko. Approximating asymmetric maximum TSP. In Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2003.
17. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
18. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. Operations Research, 18:1-11, 1993.
19. Vijay V. Vazirani. Approximation Algorithms. Springer, 2001.
20. David P. Williamson. Lecture notes on approximation algorithms. Technical Report RC 21409, IBM T. J. Watson Research Center, 1999.