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

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