Local routing algorithms on Euclidean spanners with small diameter
From MaRDI portal
Publication:6164009
DOI10.1007/978-3-031-20624-5_42MaRDI QIDQ6164009
Nicolas Bonichon, Yan Garito, Prosenjit Bose
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Towards tight bounds on theta-graphs: more is not always better
- Classes of graphs which approximate the complete Euclidean graph
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- There are planar graphs almost as good as the complete graph
- Graph spanners: a tutorial review
- On the stretch factor of convex Delaunay graphs
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Geometric Spanner Networks
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Plane Spanners of Maximum Degree Six
- Optimal Search in Planar Subdivisions
- On Hierarchical Routing in Doubling Metrics
- Truly Optimal Euclidean Spanners
- Optimal euclidean spanners
- Compact routing on euclidian metrics
- Routing with guaranteed delivery in ad hoc wireless networks
This page was built for publication: Local routing algorithms on Euclidean spanners with small diameter
