On efficient distributed construction of near optimal routing schemes (Q1741966): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improved routing strategies with succinct tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Improved Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with improved stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with low stretch factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster distributed protocol for constructing a minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem / 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: On Efficient Distributed Construction of Near Optimal Routing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Scheduling of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Minimum Cut Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and localized distributed data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs / 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: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast routing table construction using 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: Fast Partial Distance Estimation and Applications / 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 distance computation and routing with small messages / 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: Distributed computing of efficient routing schemes in generalized chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity-preserving labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed computation of distance sketches in networks / 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: Approximate distance oracles / rank
 
Normal rank

Revision as of 10:27, 15 July 2024

scientific article
Language Label Description Also known as
English
On efficient distributed construction of near optimal routing schemes
scientific article

    Statements

    On efficient distributed construction of near optimal routing schemes (English)
    0 references
    0 references
    0 references
    11 April 2018
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references