{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:20:52Z","timestamp":1771485652169,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israel Science Foundation","award":["1696\/14"],"award-info":[{"award-number":["1696\/14"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,23]]},"DOI":"10.1145\/3212734.3212760","type":"proceedings-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T16:28:33Z","timestamp":1533054513000},"page":"149-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs"],"prefix":"10.1145","author":[{"given":"Michal","family":"Dory","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Keren Censor-Hillel and Michal Dory . 2017. Fast Distributed Approximation for TAP and 2-Edge-Connectivity 21st International Conference on Principles of Distributed Systems (OPODIS). 21:1--21:20.  Keren Censor-Hillel and Michal Dory . 2017. Fast Distributed Approximation for TAP and 2-Edge-Connectivity 21st International Conference on Principles of Distributed Systems (OPODIS). 21:1--21:20."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212758"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611491"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979833920X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_6_1","unstructured":"Efim A Dinitz Alexander V Karzanov and Michael V Lomonosov . 1976. On the structure of the system of minimum edge cuts in a graph. Issledovaniya po Diskretnoi Optimizatsii (1976) 290--306.  Efim A Dinitz Alexander V Karzanov and Michael V Lomonosov . 1976. On the structure of the system of minimum edge cuts in a graph. Issledovaniya po Diskretnoi Optimizatsii (1976) 290--306."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212760"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087823"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/080732572"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1541872.1541876"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_1_14_1","unstructured":"Mohsen Ghaffari and Fabian Kuhn . 2013. Distributed Minimum Cut Approximation. CoRR Vol. abs\/1305.5520 (2013). showeprint{arxiv}1305.5520deftempurl%http:\/\/arxiv.org\/abs\/1305.5520 tempurl  Mohsen Ghaffari and Fabian Kuhn . 2013. Distributed Minimum Cut Approximation. CoRR Vol. abs\/1305.5520 (2013). showeprint{arxiv}1305.5520deftempurl%http:\/\/arxiv.org\/abs\/1305.5520 tempurl"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935795"},{"key":"e_1_3_2_1_16_1","unstructured":"Michel X Goemans Andrew V Goldberg Serge A Plotkin David B Shmoys Eva Tardos and David P Williamson . 1994. Improved Approximation Algorithms for Network Design Problems SODA Vol. Vol. 94. 223--232.   Michel X Goemans Andrew V Goldberg Serge A Plotkin David B Shmoys Eva Tardos and David P Williamson . 1994. Improved Approximation Algorithms for Network Design Problems SODA Vol. Vol. 94. 223--232."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/777474.777476"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"e_1_3_2_1_20_1","unstructured":"David R. Karger . 1993. Global Min-cuts in RNC and Other Ramifications of a Simple Min-Cut Algorithm Proceedings of the Fourth Annual Symposium on Discrete Algorithms (SODA). 21--30.   David R. Karger . 1993. Global Min-cuts in RNC and Other Ramifications of a Simple Min-Cut Algorithm Proceedings of the Fourth Annual Symposium on Discrete Algorithms (SODA). 21--30."},{"key":"e_1_3_2_1_21_1","unstructured":"Samir Khuller . 1996. Approximation algorithms for finding highly connected subgraphs Approximation algorithms for NP-hard problems. PWS Publishing Co. 236--265.   Samir Khuller . 1996. Approximation algorithms for finding highly connected subgraphs Approximation algorithms for NP-hard problems. PWS Publishing Co. 236--265."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174654"},{"key":"e_1_3_2_1_23_1","volume-title":"Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik.","author":"Kortsarz Guy","year":"2010"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Sven O Krumke Peter Merz Tim Nonner and Katharina Rupp . 2007. Distributed approximation algorithms for finding 2-edge-connected subgraphs International Conference On Principles Of Distributed Systems (OPODIS). Springer 159--173.   Sven O Krumke Peter Merz Tim Nonner and Katharina Rupp . 2007. Distributed approximation algorithms for finding 2-edge-connected subgraphs International Conference On Principles Of Distributed Systems (OPODIS). Springer 159--173.","DOI":"10.1007\/978-3-540-77096-1_12"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_30"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055449"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_32_1","unstructured":"David Pritchard . 2005. Robust network computation. Master's thesis. bibinfoschoolMIT.  David Pritchard . 2005. Robust network computation. Master's thesis. bibinfoschoolMIT."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000807.2000814"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793260763"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_36_1","unstructured":"Amir Shadeh . 2009. Distributed primal-dual approximation algorithms for network design problems. Master's thesis. bibinfoschoolOpen University of Israel.  Amir Shadeh . 2009. Distributed primal-dual approximation algorithms for network design problems. Master's thesis. bibinfoschoolOpen University of Israel."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224968"}],"event":{"name":"PODC '18: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '18","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:44Z","timestamp":1750212464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":37,"alternative-id":["10.1145\/3212734.3212760","10.1145\/3212734"],"URL":"https:\/\/doi.org\/10.1145\/3212734.3212760","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}