THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+Finding the shortest watchman route in a simple polygon
+Normal rank
@@ Property / cites work @@
+Minimum-perimeter intersecting polygons
@@ Property / cites work: Minimum-perimeter intersecting polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for TSP with neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+The traveling salesmanpProblem for lines in the plane
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
@@ Property / cites work: MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS / rank @@
+Normal rank
@@ Property / cites work @@
+CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
+Normal rank
@@ Property / cites work @@
+Fast computation of shortest watchman routes in simple polygons
+Normal rank