Worst Case Bounds for Shortest Path Interval Routing
From MaRDI portal
Publication:4209271
DOI10.1006/JAGM.1997.0915zbMATH Open0919.68047OpenAlexW2038033022MaRDI QIDQ4209271FDOQ4209271
Authors: Cyril Gavoille, Eric Guévremont 
Publication date: 31 August 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/28d21e39233a9da79857a29ee2dc0dd23c3819b7
Recommendations
- scientific article; zbMATH DE number 1760012
- The complexity of shortest path and dilation bounded interval routing
- scientific article; zbMATH DE number 1340883
- Asymptotic optimality of shortest path routing algorithms
- scientific article; zbMATH DE number 1038840
- Structural Information and Communication Complexity
- Characterization results of all shortest paths interval routing schemes
- The Compactness of Interval Routing
- Shortest-Path Routing in Arbitrary Networks
- The complexity of the characterization of networks supporting shortest-path interval routing.
Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)
Cited In (15)
- Compact and localized distributed data structures
- New bounds for multi-label interval routing
- Interval routing schemes for circular-arc graphs
- Average stretch analysis of compact routing schemes
- Direct \(k\)-routing versus cross-docking: worst-case results
- All-shortest-path 2-interval routing is NP-complete
- On the hardness of minimizing space for all-shortest-path interval routing schemes
- A survey on interval routing
- Title not available (Why is that?)
- Interval routing schemes allow broadcasting with linear message-complexity
- Interval routing in reliability networks
- The compactness of adaptive routing tables
- The complexity of the characterization of networks supporting shortest-path interval routing.
- Lower bounds for compact routing (extended abstract)
- Low-congested interval routing schemes for hypercubelike networks
This page was built for publication: Worst Case Bounds for Shortest Path Interval Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209271)
