Average stretch analysis of compact routing schemes
From MaRDI portal
Publication:875595
Recommendations
Cites work
- scientific article; zbMATH DE number 3940741 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1517100 (Why is no real title available?)
- scientific article; zbMATH DE number 1760012 (Why is no real title available?)
- scientific article; zbMATH DE number 4119974 (Why is no real title available?)
- A survey on interval routing
- A trade-off between space and efficiency for routing tables
- Compact routing schemes with low stretch factor
- Designing networks with compact routing tables
- Improved routing strategies with succinct tables
- Labelling and Implicit Routing in Networks
- Memory requirement for routing in distributed networks
- Memory requirement for universal routing schemes
- Multidimensional interval routing schemes
- On the ratio of optimal integral and fractional covers
- Routing with Polynomial Communication-Space Trade-Off
- Space-efficiency for routing schemes of stretch factor three
- Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
- The Compactness of Interval Routing
- The compactness of interval routing for almost all graphs
- Worst Case Bounds for Shortest Path Interval Routing
Cited in
(2)
This page was built for publication: Average stretch analysis of compact routing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875595)