New Routing Techniques and their Applications

DOI10.1145/2767386.2767409zbMath1333.05298arXiv1407.6730OpenAlexW2008042273MaRDI QIDQ2796238

Roei Tov, Liam Roditty

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6730

zbMATH Keywords

networksgraph theoryshortest pathsdistributed algorithmsrouting schemescompact routing schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

Approximate distance oracles with improved stretch for sparse graphs ⋮ Routing among convex polygonal obstacles in the plane ⋮ Routing in polygonal domains ⋮ Routing in unit disk graphs ⋮ Compact Routing in Unit Disk Graphs ⋮ Approximate distance oracles with improved stretch for sparse graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Routing in Polygonal Domains

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: New Routing Techniques and their Applications