Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140): Difference between revisions

@@ Property / cites work @@
+The swapping problem
@@ Property / cites work: The swapping problem / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+The Covering Salesman Problem
@@ Property / cites work: The Covering Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4191856
@@ Property / cites work: Q4191856 / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of Christofides heuristic to the k-person travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4155835
@@ Property / cites work: Q4155835 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3693290
@@ Property / cites work: Q3693290 / rank @@
+Normal rank
@@ Property / cites work @@
+Watchman routes under limited visibility
@@ Property / cites work: Watchman routes under limited visibility / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank