A PTAS for the geometric connected facility location problem (Q2408564): Difference between revisions

@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4542527
@@ Property / cites work: Q4542527 / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean prize-collecting Steiner forest
@@ Property / cites work: Euclidean prize-collecting Steiner forest / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
+Normal rank
@@ Property / cites work @@
+Q5417633
@@ Property / cites work: Q5417633 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of the Gilbert-Pollak conjecture on the Steiner ratio
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Provisioning a virtual private network
@@ Property / cites work: Provisioning a virtual private network / rank @@
+Normal rank
@@ Property / cites work @@
+How Long Can a Euclidean Traveling Salesman Tour Be?
+Normal rank
@@ Property / cites work @@
+A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median 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 / cites work @@
+Approximation schemes for node-weighted geometric Steiner tree problems
+Normal rank
@@ Property / cites work @@
+Q4526991
@@ Property / cites work: Q4526991 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank