Online unit covering in Euclidean space (Q5919348): Difference between revisions

@@ Property / cites work @@
+The Online Set Cover Problem
@@ Property / cites work: The Online Set Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138750
@@ Property / cites work: Q3138750 / rank @@
+Normal rank
@@ Property / cites work @@
+The geometry of homothetic covering and illumination
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the unit disk cover problem in 2D and 3D
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Drei Sätze über die n-dimensionale euklidische Sphäre
+Normal rank
@@ Property / cites work @@
+A survey on the kissing numbers
@@ Property / cites work: A survey on the kissing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Research Problems in Discrete Geometry
@@ Property / cites work: Research Problems in Discrete Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Online Primal-Dual Algorithms for Covering and Packing
+Normal rank
@@ Property / cites work @@
+A randomized algorithm for online unit clustering
@@ Property / cites work: A randomized algorithm for online unit clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental Clustering and Dynamic Information Retrieval
+Normal rank
@@ Property / cites work @@
+Online unit clustering in higher dimensions
@@ Property / cites work: Online unit clustering in higher dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+On kissing numbers in dimensions 32 to 128
@@ Property / cites work: On kissing numbers in dimensions 32 to 128 / rank @@
+Normal rank
@@ Property / cites work @@
+Better bounds on online unit clustering
@@ Property / cites work: Better bounds on online unit clustering / rank @@
+Normal rank
@@ Property / cites work @@
+On the online unit clustering problem
@@ Property / cites work: On the online unit clustering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+On kissing numbers and spherical codes in high dimensions
+Normal rank
@@ Property / cites work @@
+An improved lower bound for one-dimensional online unit clustering
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for minimum disk cover problems
+Normal rank
@@ Property / cites work @@
+Illuminating and covering convex bodies
@@ Property / cites work: Illuminating and covering convex bodies / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems on the illumination of convex bodies
+Normal rank
@@ Property / cites work @@
+Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+The Closest Packing of Spherical Caps in <i>n</i> Dimensions
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for online unit clustering
@@ Property / cites work: An improved algorithm for online unit clustering / rank @@
+Normal rank