Demand-aware network designs of bounded degree
From MaRDI portal
Publication:2189175
DOI10.1007/s00446-019-00351-5zbMath1445.68027arXiv1705.06024OpenAlexW2614467483MaRDI QIDQ2189175
Stefan Schmid, Kaushik Mondal, Chen Avin
Publication date: 15 June 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.06024
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A history of graph entropy measures
- An improved approximation ratio for the minimum linear arrangement problem
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Nearly optimal binary search trees
- Chordal completions of planar graphs
- rDAN: toward robust demand-aware network designs
- Self-adjusting grid networks to minimize expected path length
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
- Additive spanners and (α, β)-spanners
- Sparse Sourcewise and Pairwise Distance Preservers
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- O(log log n)-competitive dynamic binary search trees
- Spanners and emulators with sublinear distance errors
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Self-adjusting binary search trees
- Graph spanners
- The complexity of the network design problem
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- An Optimal Synchronizer for the Hypercube
- On Hierarchical Routing in Doubling Metrics
- Spanners with Slack
- A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
- Dynamic Optimality—Almost
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Optimal Assignments of Numbers to Vertices
- Small hop-diameter sparse spanners for doubling metrics
This page was built for publication: Demand-aware network designs of bounded degree
