Minimizing the sum of distances to a server in a constraint network (Q2330034): Difference between revisions

@@ Property / cites work @@
+Q2718345
@@ Property / cites work: Q2718345 / 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 @@
+Minimum weight Euclidean \(t\)-spanner is NP-hard
@@ Property / cites work: Minimum weight Euclidean \(t\)-spanner is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-hop communication networks
@@ Property / cites work: Bounded-hop communication networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the average stretch factor of geometric graphs
+Normal rank
@@ Property / cites work @@
+Average stretch factor: how low does it go?
@@ Property / cites work: Average stretch factor: how low does it go? / rank @@
+Normal rank
@@ Property / cites work @@
+Balancing minimum spanning trees and shortest-path trees
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing minimal spanning/Steiner trees with bounded path length
+Normal rank