Bounding the locality of distributed routing algorithms

DOI10.1145/1582716.1582756zbMath1291.68296MaRDI QIDQ5170322

Prosenjit Bose, Stephane Durocher, Paz Carmi

Publication date: 23 July 2014

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

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

zbMATH Keywords

dilation; distributed algorithms; local routing

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W15: Distributed algorithms

Related Items

Bounding the locality of distributed routing algorithms