The Shortest Separating Cycle Problem (Q2971152): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-51741-4_1
+Normal rank
@@ Property / OpenAlex ID @@
+W2570519564
@@ Property / OpenAlex ID: W2570519564 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Geometric Covering Salesman Problem
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Approximation schemes for degree-restricted MST and red-blue separation problems
+Normal rank
@@ Property / cites work @@
+Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for TSP with neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+Q4155835
@@ Property / cites work: Q4155835 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4948735
@@ Property / cites work: Q4948735 / rank @@
+Normal rank
@@ Property / cites work @@
+How Long Can a Euclidean Traveling Salesman Tour Be?
+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 / cites work @@
+Q2934576
@@ Property / cites work: Q2934576 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating TSP with neighborhoods and related problems
+Normal rank