Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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: W2962680238 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.03359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed connectivity decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating (unweighted) tree augmentation via lift-and-project. II / 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: Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph / 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 Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / 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: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for tree augmentation: saving by rewiring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed approximation algorithms via probabilistic tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Graph Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating node connectivity problems via set covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed construction of <i>k</i>-dominating sets and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed steiner forest construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-Tight Distributed Minimum Cut Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of small cuts via cycle space sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / 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: Sub-linear distributed algorithms for sparse certificates and biconnected components / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:34, 22 July 2024

scientific article
Language Label Description Also known as
English
Fast distributed approximation for TAP and 2-edge-connectivity
scientific article

    Statements

    Fast distributed approximation for TAP and 2-edge-connectivity (English)
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    distributed graph algorithms
    0 references
    approximation algorithms
    0 references
    distributed network design
    0 references
    connectivity augmentation
    0 references
    0 references
    0 references
    0 references

    Identifiers

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