A characterization of networks supporting linear interval routing
From MaRDI portal
Publication:5361412
DOI10.1145/197917.198095zbMath1373.68043MaRDI QIDQ5361412
Pierre Fraigniaud, Cyril Gavoille
Publication date: 29 September 2017
Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/197917.198095
Related Items
Interval routing schemes, Characterization of networks supporting multi-dimensional linear interval routing schemes, The complexity of shortest path and dilation bounded interval routing, Static and dynamic low-congested interval routing schemes, The complexity of the characterization of networks supporting shortest-path interval routing., All-shortest-path 2-interval routing is NP-complete, On the hardness of minimizing space for all-shortest-path interval routing schemes