Distributed minimum cut approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8205 LNCS, Issue , 2013, Pages 1-15

  Ghaffari, Mohsen ^a   Kuhn, Fabian ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED ALGORITHMS; HIGH PROBABILITY; LAYERING TECHNIQUES; POLY-LOGARITHMIC FACTORS; RANDOMIZED DISTRIBUTED ALGORITHMS; SYNCHRONOUS MESSAGE PASSING MODELS; TIME COMPLEXITY; UNWEIGHTED GRAPHS;

GRAPHIC METHODS;

ALGORITHMS;

EID: 84893758039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-41527-2_1     Document Type: Conference Paper

References (29)

1. Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proc. of the 31st Symp. on Princ. of Database Sys., PODS 2012, pp. 5-14 (2012)
2. Censor-Hillel, K., Ghaffari, M., Kuhn, F.: A new perspective on vertex connectivity. arXiv (2013), http://arxiv.org/abs/1304.4553
3. Chattapodhyay, A., Pitassi, T.: The story of set disjointness. SIGACT News Complexity Theory Column 67 (2011)
4. Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. on Comp. 41(5), 1235-1265 (2012)
5. Elias, P., Feinstein, A., Shannon, C.E.:Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, 117-199 (1956)
6. Elkin, M.: Distributed approximation: a survey. SIGACT News 35(4), 40-57 (2004)
7. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press (2010)
8. Ford, L.R., Fulkersonn, D.R.: Maximal flow through a network. Canad. J. Math. 8, 399-404 (1956)
9. Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. In: Proc. 23rd ACM Symposium on Theory of Computing (STOC), pp. 112-122 (1991)
10. Ghaffari, M., Kuhn, F.: Distributed minimum cut approximation. arXiv (2013), http://arxiv.org/abs/1305.5520
11. Goel, A., Kapralov, M., Khanna, S.: Graph sparsification via refinement sampling. arXiv (2010), http://arxiv.org/abs/1004.4915
12. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Math. 5(4), 545-557 (1992)
13. Kapralov, M.: Personal communication (August 2013)
14. Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In: Prc. 4th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 21-30 (1993)
15. Karger, D.R.: Random sampling in cut, flow, and network design problems. In: Proc. 26th ACM Symposium on Theory of Computing (STOC), STOC 1994, pp. 648-657 (1994)
16. Karger, D.R.: Random sampling in cut, flow, and network design problems. In: Proc. 26th ACM Symposium on Theory of Computing (STOC), pp. 648-657 (1994)
17. Karger, D.R.: Using randomized sparsification to approximate minimum cuts. In: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 424-432 (1994)
18. Karger, D.R.: Minimum cuts in near-linear time. In: Proc. 28th ACM Symp. on Theory of Computing (STOC), pp. 56-63 (1996)
19. Karger, D.R.: Minimum cuts in near-linear time. J. ACM 47(1), 46-76 (2000)
20. 2) algorithm for minimum cuts. In: Proc. 25th ACM Symposium on Theory of Computing (STOC), pp. 757-765 (1993)
21. Knuth, D.E.: Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. AMS (1996)
22. Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: Proc. of the 14th Annual ACM Symp. on Principles of Dist. Comp., PODC 1995, pp. 238-251 (1995)
23. Lomonosov, M.V., Polesskii, V.P.: Lower bound of network reliability. Problems of Information Transmission 7, 118-123 (1971)
24. Matula, D.W.: A linear time 2 + ε approximation algorithm for edge connectivity. In: Proc. of the 4th Annual ACM-SIAM Symposium on Disc. Alg., SODA 1993, pp. 500-504 (1993)
25. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discret. Math. 5(1), 54-66 (1992)
26. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
27. Picard, J.C., Queyranne, M.: Selected applications of minimum cuts in networks. Infor. 20, 19-39 (1982)
28. Razborov, A.A.: On the distributional complexity of disjointness. Theor. Comp. Sci. 106, 385-390 (1992)
29. Thurimella, R.: Sub-linear distributed algorithms for sparse certificates and biconnected components. Journal of Algorithms 23(1), 160-179 (1997)