Compact routing schemes with low stretch factor
From MaRDI portal
Publication:4808315
DOI10.1016/S0196-6774(03)00002-6zbMath1030.68106OpenAlexW2033112846MaRDI QIDQ4808315
Cyril Gavoille, Tamar Eilam, David Peleg
Publication date: 27 May 2003
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00002-6
Related Items (20)
Routing among convex polygonal obstacles in the plane ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Routing in polygonal domains ⋮ Average stretch analysis of compact routing schemes ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Compact and localized distributed data structures ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ Compact Routing in Unit Disk Graphs ⋮ Compact roundtrip routing with topology-independent node names ⋮ Space-efficient path-reporting approximate distance oracles ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Interval routing in reliability networks ⋮ Close to linear space routing schemes ⋮ A survey on interval routing ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ The complexity of the characterization of networks supporting shortest-path interval routing. ⋮ Routing in Polygonal Domains
This page was built for publication: Compact routing schemes with low stretch factor
