Routing on heavy-path WSPD-spanners

DOI10.1007/978-3-030-83508-8_44MaRDI QIDQ832910zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

routingspannerwell-separated pair decomposition

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• A data structure for dynamic trees
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A note on two problems in connexion with graphs
• Classes of graphs which approximate the complete Euclidean graph
• Compact Routing in Unit Disk Graphs
• Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Geometric Spanner Networks
• Geometric approximation algorithms
• Improved routing on the Delaunay triangulation
• Local routing in spanners based on WSPDs
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Online Routing in Triangulations
• Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
• Upper and lower bounds for online routing on Delaunay triangulations
• Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications

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)