Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
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: 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: 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: 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: 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: 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
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8647/pdf/LIPIcs-OPODIS-2017-21.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2945402626 / rank
 
Normal rank
Property / title
 
Fast Distributed Approximation for TAP and 2-Edge-Connectivity (English)
Property / title: Fast Distributed Approximation for TAP and 2-Edge-Connectivity (English) / rank
 
Normal rank

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
scientific article

    Statements

    0 references
    0 references
    30 July 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    distributed network design
    0 references
    connectivity augmentation
    0 references
    0 references
    0 references
    0 references
    Fast Distributed Approximation for TAP and 2-Edge-Connectivity (English)
    0 references