Worst Case Bounds for Shortest Path Interval Routing
From MaRDI portal
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.
Cited in
(15)- A survey on interval routing
- Interval routing in reliability networks
- The compactness of adaptive routing tables
- The complexity of the characterization of networks supporting shortest-path interval routing.
- New bounds for multi-label interval routing
- 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
- Interval routing schemes for circular-arc graphs
- scientific article; zbMATH DE number 1340883 (Why is no real title available?)
- Low-congested interval routing schemes for hypercubelike networks
- Lower bounds for compact routing (extended abstract)
- Interval routing schemes allow broadcasting with linear message-complexity
- Compact and localized distributed data structures
- Average stretch analysis of compact routing schemes
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)
