Brief annoucement: A distributed minimum cut approximation scheme

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2014, Pages 217-219

  Su, Hsin Hao ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

CONGEST model; Distributed approximation; Minimum cut

Indexed keywords

MESSAGE PASSING;

APPROXIMATION SCHEME; CENTRALIZED ALGORITHMS; DISTRIBUTED APPROXIMATION; DISTRIBUTED MODELING; MINIMUM CUT; NON-TRIVIAL ALGORITHMS; POLY-LOGARITHMIC FACTORS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 84904472343     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2612669.2612706     Document Type: Conference Paper

References (17)

1. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SI AM Journal on Computing, 41(5):1235-1265, 2012.
2. M. Elkin. Distributed approximation: A survey. SIGACT News, 35(4):40-57, 2004.
3. H. N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences, 50(2):259-273, 1995.
4. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In Proc. 27th Symposium on Distributed Computing (DISC), pages 1-15. 2013.
5. D. R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 21-30, 1993.
6. D. R. Karger. Random sampling in cut, flow, and network design problems. In Proce. 26th ACM Symposium on Theory of Computing (STOC), pages 648-657, 1994.
7. D. R. Karger. Using randomized sparsification to approximate minimum cuts. In Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 424-432, 1994.
8. D. R. Karger. Minimum cuts in near-linear time. J. ACM, 47(1):46-76, January 2000.
9. D. R. Karger and C. Stein. AnÕ (n) algorithm for minimum cuts. In Proc. 25th A CM Symposium on Theory of Computing (STOC), pages 757-765, 1993.
10. S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. In Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC), pages 238-251, 1995.
11. D. W. Matula. A linear time 2 + e approximation algorithm for edge connectivity. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 500-504, 1993.
12. H. Nagamochi and T. Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discret. Math., 5(1):54-66, 1992.
13. D. Nanongkai. Brief announcement: Almost-tight approximation distributed algorithm for minimum cut. CoRR, abs/1403.6188, 2014.
14. M. Stoer and F. Wagner. A simple min-cut algorithm. J. ACM, 44(4):585-591, 1997.
15. H.-H. Su. A distributed minimum cut approximation scheme. CoRR, abs/1401.5316, 2014.
16. M. Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91-127, 2007.
17. R. Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. Journal of Algorithms, 23(1):160-179, 1997.