The sparsest additive spanner via multiple weighted BFS trees (Q2201997): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952039123 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.01997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Amplification for Pairwise Spanner Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4/3 Additive Spanner Exponent Is Tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-linear lower bounds for distributed distance computations, even in sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast network-decomposition algorithm and its applications to constant-time distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact weighted all-pairs shortest paths in near-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Spanner Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global computation in a poorly connected world / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed construction of purely additive spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with improved stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast deterministic distributed algorithms for sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of distributed sparse spanner construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation of Nearly Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact shortest paths in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed algorithms for exact shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic almost-tight distributed algorithm for approximating single-source shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed all pairs shortest paths and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New pairwise spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners: A Simple Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed distance computation and routing with small messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed source detection with limited bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex fault tolerant additive spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congested Clique Algorithms for Graph Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for ultrasparse spanners and linear size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners in Nearly Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic distributed construction of spanners / rank
 
Normal rank

Latest revision as of 11:33, 4 December 2024

scientific article
Language Label Description Also known as
English
The sparsest additive spanner via multiple weighted BFS trees
scientific article

    Statements

    The sparsest additive spanner via multiple weighted BFS trees (English)
    0 references
    0 references
    0 references
    0 references
    17 September 2020
    0 references
    distributed graph algorithms
    0 references
    congest model
    0 references
    weighted BFS trees
    0 references
    additive spanners
    0 references
    0 references
    0 references

    Identifiers