论文信息 - An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two

An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two

Abstract We present an approximation algorithm, with a performance ratio of at most 17⧸12, for the asymmetric travelling salesman problem with distances one and two. This problem is equivalent (in a sense that we describe in the paper) to the problem of covering the vertices of a diagraph with a minimum number of vertex-disjoint paths.

Sundar Vishwanathan | S. Vishwanathan

[1] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

[2] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[3] Shlomo Moran,et al. Optimal Covering of Cacti by Vertex-Disjoint Paths , 1991, Theor. Comput. Sci..

[4] Ilan Newman,et al. Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight , 1990, Networks.

[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[7] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] James F. Gimpel,et al. Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization , 1977, JACM.