Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1907.12011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast Distributed Algorithms for Metric Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximate Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in distributed computing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of distributed task allocation / 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: A distributed O(1)-approximation algorithm for the uniform facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MST in Log-Star Rounds of Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lessons from the congested clique applied to MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: A fast distributed approximation algorithm for minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation of Large-scale Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Partial Distance Estimation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient determination of the transitive closure of a directed graph / 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: Connectivity Lower Bounds in Broadcast Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-Labeling Schemes: Broadcast, Unicast and in Between / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of distributed sorting / 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: Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966268726 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:30, 30 July 2024

scientific article; zbMATH DE number 7334832
Language Label Description Also known as
English
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
scientific article; zbMATH DE number 7334832

    Statements

    Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (English)
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    Steiner tree
    0 references
    shortest path forest
    0 references
    CONGESTED CLIQUE
    0 references
    distributed approximation algorithm
    0 references
    0 references
    0 references

    Identifiers

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