Compact routing with slack

DOI10.1145/1281100.1281114zbMATH Open1283.68054OpenAlexW2008007365MaRDI QIDQ5401396FDOQ5401396

Authors: Michael Dinitz 

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Recommendations

• Compact routing with slack in low doubling dimension
• Compact Multicast Routing
• scientific article; zbMATH DE number 1305414
• Compact routing with minimum stretch
• Compact routing schemes with low stretch factor
• Compact routing for flat networks
• Compact routing schemes with improved stretch
• Compact oblivious routing
• Designing networks with compact routing tables
• Compact policy routing

zbMATH Keywords

compact routingslack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Signed and weighted graphs (05C22) Network design and communication in computer systems (68M10)

Cited In (4)

• Compact routing with slack in low doubling dimension
• Advances in metric embedding theory
• Volume in general metric spaces
• A note on distance-preserving graph sparsification

This page was built for publication: Compact routing with slack

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