Brief announcement: Almost-tight approximation distributed algorithm for minimum cut

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2014, Pages 382-384

  Nanongkai, Danupon ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Congest model; Distributed computing; Graph algorithms; Minimum cut; Time complexity

Indexed keywords

APPROXIMATION ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; FORESTRY;

GRAPH ALGORITHMS; LOWER BOUNDS; MINIMUM CUT; NETWORK DIAMETER; TIME ALGORITHMS; TIME COMPLEXITY; TREE PACKING THEOREM; TREE PARTITIONING;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTATION; COMPUTER PROGRAMING; FORESTRY; MATHEMATICAL MODELS;

EID: 84905457518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2611462.2611511     Document Type: Conference Paper

References (10)

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. In
2. M. Elkin, H. Klauck, D. Nanongkai, and G. Pandurangan. Can quantum communication speed up distributed computation? In PODC, 2014.
3. M. Ghaffari and F. Kuhn. Distributed minimum cut approximation. In DISC, pages 15, 2013.
4. D. R. Karger. Random sampling in cut, flow, and network design problems. In STOC, pages 648-657, 1994.
5. D. R. Karger. Minimum cuts in near-linear time. J. ACM, 47(1):46-76, 2000.
6. S. Kutten and D. Peleg. Fast distributed construction of small k-dominating sets and applications. J. Algorithms, 28(1):40-66, 1998.
7. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Society for Industrial and Applied Mathematics Monographs on Discrete Mathematics ans Applications, Philadelphia, 2000.
8. H. Su. Brief announcement: A distributed minimum cut approximation scheme. In SPAA, 2014.
9. M. Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91-127, 2007.
10. R. Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. J. Algorithms, 23(1):160-179, 1997.