The complexity of shortest path and dilation bounded interval routing

DOI10.1016/S0304-3975(98)00042-5zbMath0947.68002OpenAlexW2044606924WikidataQ126551847 ScholiaQ126551847MaRDI QIDQ1575668

Peter Ružička, Rastislav Královič, Daniel Štefanković

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00042-5

zbMATH Keywords

complexitycompact routingdilation bounded interval routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (6)

New bounds for multi-label interval routing ⋮ Compact and localized distributed data structures ⋮ Interval routing in reliability networks ⋮ The compactness of adaptive routing tables ⋮ A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing ⋮ Ordered interval routing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic routing with bounded buffers: turning offline into online protocols
• Labelling and Implicit Routing in Networks
• The complexity of interval routing on random graphs
• Interval Routing
• Lower bounds for compact routing
• A trade-off between space and efficiency for routing tables
• A characterization of networks supporting linear interval routing
• Interval routing schemes

This page was built for publication: The complexity of shortest path and dilation bounded interval routing