Compact routing with minimum stretch
From MaRDI portal
Recommendations
Cited in
(47)- Compact routing messages in self-healing trees
- New pairwise spanners
- On efficient distributed construction of near optimal routing schemes
- Interval routing in reliability networks
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Near-optimal induced universal graphs for cycles and paths
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- New routing techniques and their applications
- A compact routing scheme and approximate distance oracle for power-law graphs
- Improved approximation for the directed spanner problem
- Fault-Tolerant Compact Routing Schemes for General Graphs
- Models and algorithms for network reduction
- Small stretch pairwise spanners and approximate D-preservers
- scientific article; zbMATH DE number 1305414 (Why is no real title available?)
- scientific article; zbMATH DE number 2080868 (Why is no real title available?)
- On the efficiency of routing in sensor networks
- Compact routing schemes with low stretch factor
- Multipath spanners via fault-tolerant spanners
- Transitive-closure spanners: a survey
- Compact name-independent routing with minimum stretch
- Compact oblivious routing
- Routing in polygonal domains
- Compact and localized distributed data structures
- Compact routing schemes with improved stretch
- Compact routing on power law graphs with additive stretch
- Distributed Computing
- Compact routing with slack
- Compact routing on Euclidian metrics
- Compact oblivious routing in weighted graphs
- Compact policy routing
- Compact routing for flat networks
- Compact roundtrip routing with topology-independent node names
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Compact policy routing
- Close to linear space routing schemes
- Compact Routing in Unit Disk Graphs
- Routing among convex polygonal obstacles in the plane
- Closing the gap: minimum space optimal time distance labeling scheme for interval graphs
- Color fault-tolerant spanners
- A divide-and-conquer based preprocessing for routing in a simple polygon
- \(f\)-sensitivity distance oracles and routing schemes
- Spanner approximations in practice
- An approximation algorithm for the edge-dilation \(k\)-center problem.
- Routing among convex polygonal obstacles in the plane using a simplified domain
- Average stretch analysis of compact routing schemes
- Fast deterministic distributed algorithms for sparse spanners
This page was built for publication: Compact routing with minimum stretch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709798)
