论文信息 - A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

Abstract Two algorithms are presented for the asymmetric travelling salesman problem. The worst case performance of both of them is bounded by quantities which are independent on the size of the problem (number of vertices) but depend on the weights associated to the arcs. The second algorithm improves a bound previously obtained under identical hypothesis.

Giovanni Righini | Marco Trubian

[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .

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

[3] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..

[4] Sundar Vishwanathan,et al. An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two , 1992, Inf. Process. Lett..

[5] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

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

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