Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206): Difference between revisions

@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Approximating the Metric TSP in Linear Time
@@ Property / cites work: Approximating the Metric TSP in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+The Travelling Salesman and the PQ-Tree
@@ Property / cites work: The Travelling Salesman and the PQ-Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
+Normal rank
@@ Property / cites work @@
+Q4461911
@@ Property / cites work: Q4461911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3693290
@@ Property / cites work: Q3693290 / rank @@
+Normal rank
@@ Property / cites work @@
+Good triangulations yield good tours
@@ Property / cites work: Good triangulations yield good tours / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3931037
@@ Property / cites work: Q3931037 / rank @@
+Normal rank