scientific article; zbMATH DE number 7378692

DOI10.4230/LIPIcs.ESA.2018.22MaRDI QIDQ5009579

Vincent Despré, Nicolas Bonichon, Prosenjit Bose, Darryl Hill, Jean-Lou De Carufel, Michiel H. M. Smid

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphgeometricDelaunaylocal routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Routing on heavy-path WSPD-spanners ⋮ Local routing in sparse and lightweight geometric graphs ⋮ On the spanning and routing ratio of the directed theta-four graph

Cites Work

• Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations
• Delaunay graphs are almost as good as complete graphs
• Classes of graphs which approximate the complete Euclidean graph
• There are planar graphs almost as good as the complete graph
• Upper and lower bounds for online routing on Delaunay triangulations
• Competitive Online Routing on Delaunay Triangulations
• Geometric Spanner Networks
• Upper and Lower Bounds for Online Routing on Delaunay Triangulations
• Improved upper bound on the stretch factor of delaunay triangulations
• Unnamed Item
• Unnamed Item