The complexity of shortest path and dilation bounded interval routing
From MaRDI portal
Publication:1575668
DOI10.1016/S0304-3975(98)00042-5zbMath0947.68002MaRDI QIDQ1575668
Daniel Štefanković, Rastislav Královič, Peter Ružička
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68M10: Network design and communication in computer systems
Related Items
A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing, Ordered interval routing schemes, Interval routing in reliability networks, The compactness of adaptive routing tables, New bounds for multi-label interval routing
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