Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
From MaRDI portal
Recommendations
Cited in
(19)- On the power of the semi-separated pair decomposition
- Temporal cliques admit sparse spanners
- A spanner for the day after
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Matching point sets with respect to the earth mover's distance
- On the Power of the Semi-Separated Pair Decomposition
- Fully dynamic randomized algorithms for graph spanners
- Geometric Spanner of Objects under L 1 Distance
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- A spanner for the day after
- Temporal cliques admit sparse spanners
- A geometric spanner of segments
- Geometric Spanner of Segments
- Fully dynamic geometric spanners
- Ordered theta graphs
- Local routing algorithms on Euclidean spanners with small diameter
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
This page was built for publication: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807649)