A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM (Q5322316): Difference between revisions

@@ Property / cites work @@
+Improved algorithms for discs and balls using power diagrams
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for constructing the weighted Voronoi diagram in the plane
+Normal rank
@@ Property / cites work @@
+Approximation of geometric dispersion problems
@@ Property / cites work: Approximation of geometric dispersion problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Randomized incremental construction of abstract Voronoi diagrams
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+A study on two geometric location problems
@@ Property / cites work: A study on two geometric location problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218195909002952
+Normal rank
@@ Property / OpenAlex ID @@
+W2104589295
@@ Property / OpenAlex ID: W2104589295 / rank @@
+Normal rank