Routing with Polynomial Communication-Space Trade-Off
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Recommendations
Cited in
(42)- On sparse spanners of weighted graphs
- Graph theoretical issues in computer networks
- Optimal layouts on a chain ATM network
- Simple and efficient network decomposition and synchronization
- New pairwise spanners
- Sublinear fully distributed partition with applications
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Distributed distance computation and routing with small messages
- Deterministic M2M multicast in radio networks
- Distributed strong diameter network decomposition
- Improved routing strategies with succinct tables
- Small stretch pairwise spanners and approximate D-preservers
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- A complete characterization of the path layout construction problem for ATM networks with given hop count and load
- A trade-off between space and efficiency for routing tables
- scientific article; zbMATH DE number 4119974 (Why is no real title available?)
- Distributed spanner approximation
- Local computation algorithms for spanners
- Universal routing schemes
- Sparse communication networks and efficient routing in the plane
- Compact and localized distributed data structures
- Space-efficient path-reporting approximate distance oracles
- Sparse communication networks and efficient routing in the plane (extended abstract)
- Distributed Routing in Tree Networks with Few Landmarks
- Routing with Improved Communication-Space Trade-Off
- Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
- Compact roundtrip routing with topology-independent node names
- Interval routing schemes
- Close to linear space routing schemes
- Optimal layouts on a chain ATM network
- Strong-diameter decompositions of minor free graphs
- On multi-label linear interval routing schemes
- Approximation of minimum weight spanners for sparse graphs
- Optimal Euclidean tree covers
- Negative-weight single-source shortest paths in near-linear time
- Constant-round spanners and shortest paths in congested clique and MPC
- Vector clock optimization via latency lengths
- Optimal Euclidean tree covers
- Lower bounds on tree covers
- Near-optimal directed low-diameter decompositions
- A faster distributed protocol for constructing a minimum spanning tree
- Average stretch analysis of compact routing schemes
This page was built for publication: Routing with Polynomial Communication-Space Trade-Off
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012441)
