Deformable spanners and applications
From MaRDI portal
Publication:2507157
Recommendations
Cites work
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- scientific article; zbMATH DE number 1263225 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 2119653 (Why is no real title available?)
- scientific article; zbMATH DE number 2119656 (Why is no real title available?)
- scientific article; zbMATH DE number 2119744 (Why is no real title available?)
- scientific article; zbMATH DE number 910882 (Why is no real title available?)
- scientific article; zbMATH DE number 1424297 (Why is no real title available?)
- scientific article; zbMATH DE number 6469222 (Why is no real title available?)
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximating the Stretch Factor of Euclidean Graphs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Clustering to minimize the maximum intercluster distance
- Collision detection for deforming necklaces
- Data Structures for Mobile Data
- Discrete mobile centers
- Distributed Computing: A Locality-Sensitive Approach
- ENUMERATING INTERDISTANCES IN SPACE
- Efficient construction of a bounded-degree spanner with low weight
- Efficient maintenance and self-collision testing for kinematic chains
- Improved algorithms for constructing fault-tolerant spanners
- SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
- SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
- Smooth kinetic maintenance of clusters
- Space-efficient approximate Voronoi diagrams
- Sphere packings give an explicit bound for the Besicovitch covering theorem
Cited in
(30)- There are plane spanners of degree 4 and moderate stretch factor
- Temporal clustering
- Optimal nearest neighbor queries in sensor networks
- Online spanners in metric spaces
- Kinetic facility location
- Kinetic spanners in \(\mathbb R^{d}\)
- A simple and efficient kinetic spanner
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Minimum weight Euclidean (1+)-spanners
- On approximate geodesic-distance queries amid deforming point clouds
- Kinetic clustering of points on the line
- A simple and efficient kinetic spanner
- Online Euclidean spanners
- Kinetic spanners in \(\mathbb{R}^d\)
- Kinetic Maintenance of Mobile k-Centres on Trees
- Fully dynamic geometric spanners
- Light Euclidean Steiner spanners in the plane
- Local routing in a tree metric 1-spanner
- Kinetic maintenance of mobile \(k\)-centres on trees
- Online Spanners in Metric Spaces
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- Near isometric terminal embeddings for doubling metrics
- Near isometric terminal embeddings for doubling metrics
- Relaxed spanners for directed disk graphs
- Minimizing co-location potential of moving entities
- Deformable spanners and applications
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
- Light Euclidean Spanners with Steiner Points
- Topological stability of kinetic \(k\)-centers
This page was built for publication: Deformable spanners and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507157)
