Routing on heavy-path WSPD-spanners
From MaRDI portal
Publication:832910
DOI10.1007/978-3-030-83508-8_44OpenAlexW3103645939MaRDI QIDQ832910FDOQ832910
Authors: Prosenjit Bose, Tyler Tuttle 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_44
Cites Work
- A note on two problems in connexion with graphs
- A data structure for dynamic trees
- Geometric Spanner Networks
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Geometric approximation algorithms
- Classes of graphs which approximate the complete Euclidean graph
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Online Routing in Triangulations
- Title not available (Why is that?)
- Local routing in spanners based on WSPDs
- Upper and lower bounds for online routing on Delaunay triangulations
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Improved routing on the Delaunay triangulation
- Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- Compact Routing in Unit Disk Graphs
This page was built for publication: Routing on heavy-path WSPD-spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832910)
