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