Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194): Difference between revisions

@@ Property / DOI @@
-.1137/22m1489034
@@ Property / DOI: 10.1137/22m1489034 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/22m1489034
+Normal rank
@@ Property / OpenAlex ID @@
+W4392820947
@@ Property / OpenAlex ID: W4392820947 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Lower Bounds for Sublinear Additive Spanners
+Normal rank
@@ Property / cites work @@
+Using petal-decompositions to build a low stretch spanning tree
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem
+Normal rank
@@ Property / cites work @@
+Complexity of network synchronization
@@ Property / cites work: Complexity of network synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming algorithm for graph spanners-single pass and constant processing time per edge
+Normal rank
@@ Property / cites work @@
+Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
+Normal rank
@@ Property / cites work @@
+Single-Source Shortest Paths in the CONGEST Model with Improved Bound
+Normal rank
@@ Property / cites work @@
+Polylog-time and near-linear work approximation scheme for undirected shortest paths
+Normal rank
@@ Property / cites work @@
+Solving SDD linear systems in nearly             <i>m</i>             log             <sup>1/2</sup>             <i>n</i>             time
+Normal rank
@@ Property / cites work @@
+Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
+Normal rank
@@ Property / cites work @@
+Lower-Stretch Spanning Trees
@@ Property / cites work: Lower-Stretch Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Strong Diameter Network Decomposition
@@ Property / cites work: Distributed Strong Diameter Network Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
+Normal rank
@@ Property / cites work @@
+Oblivious Routing for the Lp-norm
@@ Property / cites work: Oblivious Routing for the Lp-norm / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic low-stretch trees via dynamic low-diameter decompositions
+Normal rank
@@ Property / cites work @@
+Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
+Normal rank
@@ Property / cites work @@
+A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
+Normal rank
@@ Property / cites work @@
+Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
+Normal rank
@@ Property / cites work @@
+Near-Optimal Distributed Maximum Flow
@@ Property / cites work: Near-Optimal Distributed Maximum Flow / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of local distributed graph problems
+Normal rank
@@ Property / cites work @@
+Q4945538
@@ Property / cites work: Q4945538 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral sparsification via random spanners
@@ Property / cites work: Spectral sparsification via random spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient distributed approximation algorithms via probabilistic tree embeddings
+Normal rank
@@ Property / cites work @@
+A Nearly-m log n Time Solver for SDD Linear Systems
+Normal rank
@@ Property / cites work @@
+Approaching Optimality for Solving SDD Linear Systems
+Normal rank
@@ Property / cites work @@
+Fast Distributed Construction of Smallk-Dominating Sets and Applications
+Normal rank
@@ Property / cites work @@
+Distributed distance computation and routing with small messages
+Normal rank
@@ Property / cites work @@
+Low diameter graph decompositions
@@ Property / cites work: Low diameter graph decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Verification and Hardness of Distributed Approximation
+Normal rank
@@ Property / cites work @@
+Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
+Normal rank
@@ Property / cites work @@
+Near-optimal approximate shortest paths and transshipment in distributed and streaming models
+Normal rank
@@ Property / DOI @@
+.1137/22M1489034
@@ Property / DOI: 10.1137/22M1489034 / rank @@
+Normal rank