Lower bounds for compact routing

DOI10.1007/3-540-60922-9_43zbMath1379.68015OpenAlexW1575592201MaRDI QIDQ4593958

Evangelos Kranakis, Danny Krizanc

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Related Items (6)

Interval routing schemes allow broadcasting with linear message-complexity ⋮ Compact and localized distributed data structures ⋮ The compactness of adaptive routing tables ⋮ The complexity of shortest path and dilation bounded interval routing ⋮ A survey on interval routing ⋮ On the complexity of multi-dimensional interval routing schemes

This page was built for publication: Lower bounds for compact routing