FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094): Difference between revisions

@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+Rectilinear paths among rectilinear obstacles
@@ Property / cites work: Rectilinear paths among rectilinear obstacles / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-link watchman tours
@@ Property / cites work: Minimum-link watchman tours / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Covering Tours with Turn Costs
@@ Property / cites work: Optimal Covering Tours with Turn Costs / rank @@
+Normal rank
@@ Property / cites work @@
+Traversing a set of points with a minimum number of turns
+Normal rank
@@ Property / cites work @@
+COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / cites work @@
+Covering things with things
@@ Property / cites work: Covering things with things / rank @@
+Normal rank
@@ Property / cites work @@
+The exact fitting problem in higher dimensions
@@ Property / cites work: The exact fitting problem in higher dimensions / rank @@
+Normal rank