Distributed Spanner Approximation (Q4997324): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Distributed Optimization / 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: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / 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: Approximation algorithms for spanner problems and directed Steiner forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding sparser directed spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed construction of purely additive spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with improved stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / 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: Sublinear fully distributed partition with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed spanners via flow-based linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Distance-Bounded Network Design Through Distributed Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Low-Stretch Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / 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: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners / 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 Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-spanner problems for \(k>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set / 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: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (∆+1)-coloring in sublogarithmic rounds / 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: An efficient distributed algorithm for constructing small dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Low-Degree 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / 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: 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: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roundtrip spanners and roundtrip routing in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:48, 26 July 2024

scientific article; zbMATH DE number 7364233
Language Label Description Also known as
English
Distributed Spanner Approximation
scientific article; zbMATH DE number 7364233

    Statements

    Distributed Spanner Approximation (English)
    0 references
    0 references
    0 references
    29 June 2021
    0 references
    spanners
    0 references
    distributed algorithms
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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