Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410): Difference between revisions

@@ Property / cites work @@
+A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-hop minimum-spanning trees
@@ Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank @@
+Normal rank
@@ 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 @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Greedy Strikes Back: Improved Facility Location Algorithms
+Normal rank
@@ Property / cites work @@
+Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
+Normal rank
@@ Property / cites work @@
+A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem
+Normal rank
@@ Property / cites work @@
+Q4411290
@@ Property / cites work: Q4411290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501342
@@ Property / cites work: Q5501342 / rank @@
+Normal rank