Average stretch analysis of compact routing schemes
From MaRDI portal
Publication:875595
DOI10.1016/J.DAM.2006.09.010zbMATH Open1161.68362OpenAlexW2015704876MaRDI QIDQ875595FDOQ875595
Authors: Tamar Eilam, Cyril Gavoille, David Peleg 
Publication date: 13 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.09.010
Recommendations
Cites Work
- On the ratio of optimal integral and fractional covers
- Title not available (Why is that?)
- The Compactness of Interval Routing
- Designing networks with compact routing tables
- Improved routing strategies with succinct tables
- Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
- A survey on interval routing
- The compactness of interval routing for almost all graphs
- Memory requirement for routing in distributed networks
- Labelling and Implicit Routing in Networks
- A trade-off between space and efficiency for routing tables
- Space-efficiency for routing schemes of stretch factor three
- Routing with Polynomial Communication-Space Trade-Off
- Compact routing schemes with low stretch factor
- Memory requirement for universal routing schemes
- Multidimensional interval routing schemes
- Title not available (Why is that?)
- Worst Case Bounds for Shortest Path Interval Routing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
