论文信息 - Double-Tree Approximations for Metric TSP: Is the Best One Good Enough? - 字舞流文

Double-Tree Approximations for Metric TSP: Is the Best One Good Enough?

Vladimir G. Deineko | Alexander Tiskin | V. Deineko | A. Tiskin

[1] Gerhard J. Woeginger,et al. The Travelling Salesman and the PQ-Tree , 1996, IPCO.

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] G. L. Nemhauser,et al. Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

[4] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[5] G. Vetrovec. DES , 2021, Encyclopedia of Systems and Control.

[6] GraphsThomas,et al. Polynomial-Time Approximation S hemes for Geometri , 2001 .

[7] G. Reinelt. The Traveling Salesman Problem: Computational Solutions for TSP Applications, Lecture Notes , 1994 .

[8] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9] Christos H. Papadimitriou,et al. On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[10] Santosh S. Vempala,et al. On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[11] Gerhard J. Woeginger,et al. Erratum: The Travelling Salesman and the PQ-Tree , 1999, Math. Oper. Res..