Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut

@inproceedings{Nanongkai2014BriefAA,
  title={Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut},
  author={Danupon Nanongkai},
  booktitle={PODC},
  year={2014}
}
In this short paper, we present an improved algorithm for approximating the minimum cut on distributed (CONGEST) networks. Let λ be the minimum cut. Our algorithm can compute λ exactly in O((√n+D) poly(λ)) time, where n is the number of nodes (processors) in the network, D is the network diameter, and ~O hides poly log n. By a standard reduction, we can convert this algorithm into a (1+ε)-approximation O((√n+D)/poly(ε))-time algorithm. The latter result improves over the previous (2… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
4 Extracted Citations
3 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-3 of 3 references

Similar Papers

Loading similar papers…