{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:47:35Z","timestamp":1753181255468,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612706","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"217-219","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A distributed minimum cut approximation scheme"],"prefix":"10.1145","author":[{"given":"Hsin-Hao","family":"Su","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054916.1054931"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1022"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_1"},{"key":"e_1_3_2_1_5_1","first-page":"21","volume-title":"Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Karger D. R.","year":"1993","unstructured":"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 . 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."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195422"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/314464.314582"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167281"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224990"},{"key":"e_1_3_2_1_11_1","first-page":"500","volume-title":"Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Matula D. W.","year":"1993","unstructured":"D. W. Matula . A linear time 2 + \u03b5 approximation algorithm for edge connectivity . In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 500 -- 504 , 1993 . D. W. Matula. A linear time 2 + \u03b5 approximation algorithm for edge connectivity. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 500--504, 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"e_1_3_2_1_13_1","volume-title":"Brief announcement: Almost-tight approximation distributed algorithm for minimum cut. CoRR, abs\/1403.6188","author":"Nanongkai D.","year":"2014","unstructured":"D. Nanongkai . Brief announcement: Almost-tight approximation distributed algorithm for minimum cut. CoRR, abs\/1403.6188 , 2014 . D. Nanongkai. Brief announcement: Almost-tight approximation distributed algorithm for minimum cut. CoRR, abs\/1403.6188, 2014."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_1_15_1","volume-title":"abs\/1401.5316","author":"Su H.-H.","year":"2014","unstructured":"H.-H. Su . A distributed minimum cut approximation scheme. CoRR , abs\/1401.5316 , 2014 . H.-H. Su. A distributed minimum cut approximation scheme. CoRR, abs\/1401.5316, 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0045-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0832"}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612706","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:35Z","timestamp":1750230095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":17,"alternative-id":["10.1145\/2612669.2612706","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612706","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}