Local Routing in Sparse and Lightweight Geometric Graphs

DOI10.4230/LIPICS.ISAAC.2019.30MaRDI QIDQ5875592zbMATH OpenOpenAlexFDO

Authors Vikrant Ashvinkumar, Joachim Gudmundsson, Bengt J. Nilsson, André van Renssen, Christos Levcopoulos

Publication date 3 February 2023

Full work available at URL http://arxiv.org/pdf/1909.10215.pdf

zbMATH Keywords

computational geometryroutingspanners

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Local routing in sparse and lightweight geometric graphs
• Improved routing on the Delaunay triangulation
• Upper and lower bounds for online routing on Delaunay triangulations
• Upper and lower bounds for online routing on Delaunay triangulations
• Improved routing on the Delaunay triangulation

Cited in

(8)

• On local routing of two-terminal nets
• Local routing in a tree metric 1-spanner
• Local routing in a tree metric 1-spanner
• Local routing in sparse and lightweight geometric graphs
• Dynamic routing schemes for graphs with low local density
• Lightweight paths in graphs
• Construction and Local Routing for Angle-Monotone Graphs
• On a family of strong geometric spanners that admit local routing strategies

This page was built for publication: Local Routing in Sparse and Lightweight Geometric Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875592)