ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1905.10833
  4. Cited By
Improved Distributed Approximations for Minimum-Weight
  Two-Edge-Connected Spanning Subgraph

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph

26 May 2019
Michal Dory
M. Ghaffari
ArXivPDFHTML

Papers citing "Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph"

4 / 4 papers shown
Title
A Nearly Time-Optimal Distributed Approximation of Minimum Cost
  $k$-Edge-Connected Spanning Subgraph
A Nearly Time-Optimal Distributed Approximation of Minimum Cost kkk-Edge-Connected Spanning Subgraph
Michal Dory
M. Ghaffari
25
2
0
09 Nov 2022
Low-Congestion Shortcuts in Constant Diameter Graphs
Low-Congestion Shortcuts in Constant Diameter Graphs
Shimon Kogan
M. Parter
18
11
0
03 Jun 2021
Distributed Constructions of Dual-Failure Fault-Tolerant Distance
  Preservers
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
M. Parter
15
9
0
04 Oct 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory
Yuval Efron
Sagnik Mukhopadhyay
Danupon Nanongkai
27
21
0
20 Apr 2020
1