Routing on heavy-path WSPD-spanners

DOI10.1007/978-3-030-83508-8_44OpenAlexW3103645939MaRDI QIDQ832910

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

zbMATH Keywords

routingspannerwell-separated pair decomposition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Classes of graphs which approximate the complete Euclidean graph
• Routing in unit disk graphs
• A data structure for dynamic trees
• Local routing in spanners based on WSPDs
• Upper and lower bounds for online routing on Delaunay triangulations
• Geometric Spanner Networks
• Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Online Routing in Triangulations
• Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• 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