A characterization of networks supporting linear interval routing

DOI10.1145/197917.198095MaRDI QIDQ5361412zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Cited in

(7)

• 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
• Interval routing schemes
• Characterization of networks supporting multi-dimensional linear interval routing schemes

This page was built for publication: A characterization of networks supporting linear interval routing

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