An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109): Difference between revisions

@@ Property / author @@
+Lee-Ad J. Gottlieb
@@ Property / author: Lee-Ad J. Gottlieb / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-87744-8_40
+Normal rank
@@ Property / OpenAlex ID @@
+W1769399376
@@ Property / OpenAlex ID: W1769399376 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for approximate nearest neighbor searching fixed dimensions
+Normal rank
@@ Property / cites work @@
+Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
+Normal rank
@@ Property / cites work @@
+Ordered theta graphs
@@ Property / cites work: Ordered theta graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition of multidimensional point sets with applications to             <i>k</i>             -nearest-neighbors and             <i>n</i>             -body potential fields
+Normal rank
@@ Property / cites work @@
+Searching dynamic point sets in spaces with bounded doubling dimension
+Normal rank
@@ Property / cites work @@
+Deformable spanners and applications
@@ Property / cites work: Deformable spanners and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579450
@@ Property / cites work: Q3579450 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
+Normal rank
@@ Property / cites work @@
+Q5501341
@@ Property / cites work: Q5501341 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic geometric spanners
@@ Property / cites work: Fully dynamic geometric spanners / rank @@
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
@@ Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Euclidean distances by small degree graphs
+Normal rank
@@ Property / cites work @@
+A sparse graph almost as good as the complete graph on points in \(k\) dimensions
+Normal rank