Compact routing schemes with improved stretch

DOI10.1145/2484239.2484268MaRDI QIDQ5176080zbMATH OpenOpenAlexFDO

Authors Shiri Chechik

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2484239.2484268

zbMATH Keywords

compact routingname-independent routingstretch factor

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Compact routing with minimum stretch
• scientific article; zbMATH DE number 1305414
• New routing techniques and their applications
• Compact name-independent routing with minimum stretch
• Routing with Improved Communication-Space Trade-Off

Cited in

(37)

• Compact routing messages in self-healing trees
• On efficient distributed construction of near optimal routing schemes
• Constructing light spanners deterministically in near-linear time
• Routing among convex polygonal obstacles in the plane
• Routing in polygonal domains
• The sparsest additive spanner via multiple weighted BFS trees
• Compact routing with minimum stretch
• New routing techniques and their applications
• A compact routing scheme and approximate distance oracle for power-law graphs
• Compact Multicast Routing
• scientific article; zbMATH DE number 1305414 (Why is no real title available?)
• Compact routing schemes with low stretch factor
• Local algorithms for bounded degree sparsifiers in sparse graphs
• Distributed spanner approximation
• Constructing Light Spanners Deterministically in Near-Linear Time
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees
• Routing in polygonal domains
• Space-efficient path-reporting approximate distance oracles
• On efficient distributed construction of near optimal routing schemes (extended abstract)
• Distributed Computing
• Compact routing with slack
• Close to linear space routing schemes
• Compact routing on Euclidian metrics
• Compact Routing with Name Independence
• Compact oblivious routing in weighted graphs
• Compact routing for flat networks
• Approximate distance oracles with improved stretch for sparse graphs
• Space-efficiency for routing schemes of stretch factor three
• Close to linear space routing schemes
• Approximate distance oracles with improved stretch for sparse graphs
• Compact Routing in Unit Disk Graphs
• Certification of compact low-stretch routing schemes
• Routing among convex polygonal obstacles in the plane
• A divide-and-conquer based preprocessing for routing in a simple polygon
• Constant-round spanners and shortest paths in congested clique and MPC
• Routing among convex polygonal obstacles in the plane using a simplified domain
• Average stretch analysis of compact routing schemes

This page was built for publication: Compact routing schemes with improved stretch

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