APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+TSP with neighborhoods of varying size
@@ Property / cites work: TSP with neighborhoods of varying size / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for TSP with neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218195909002897
+Normal rank
@@ Property / OpenAlex ID @@
+W2113076619
@@ Property / OpenAlex ID: W2113076619 / rank @@
+Normal rank