论文信息 - An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem - 字舞流文

An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

Chandra Chekuri | Martin Pál | C. Chekuri | Martin Pál

[1] Han Hoogeveen,et al. Analysis of Christofides' heuristic: Some paths are more difficult than cycles , 1991, Oper. Res. Lett..

[2] Samir Khuller,et al. Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem , 1998, Algorithmica.

[3] Robert E. Tarjan,et al. Faster parametric shortest path and minimum-balance algorithms , 1991, Networks.

[4] R. Ravi,et al. Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems , 2007, APPROX-RANDOM.

[5] Alantha Newman,et al. Traveling salesman path problems , 2008, Math. Program..

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

[7] Chandra Chekuri,et al. A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[8] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[9] Eugene L. Lawler,et al. A Guided Tour of Combinatorial Optimization , 1985 .

[10] Moshe Lewenstein,et al. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[11] Mohit Singh,et al. Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs , 2007, APPROX-RANDOM.