The connected disk covering problem (Q1702836): Difference between revisions

@@ Property / cites work @@
+The slab dividing approach to solve the Euclidean \(P\)-center problem
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithm for placing a given number of base stations to cover a convex region
+Normal rank
@@ Property / cites work @@
+VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
+Normal rank
@@ Property / cites work @@
+The p-Centre Problem-Heuristic and Optimal Algorithms
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for \(k\)-center problem on a convex polygon
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+Computing the Line-Constrained k-center in the Plane for Small k
+Normal rank
@@ Property / cites work @@
+Some variations on constrained minimum enclosing circle problem
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Minimum connected dominating sets and maximal independent sets in unit disk graphs
+Normal rank