Local Routing in Sparse and Lightweight Geometric Graphs

Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos +2

Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no $O(1)$-competitive online r…