{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:49Z","timestamp":1763468329576,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"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":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933086","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"3-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A Distributed (2+\u03b5)-Approximation for Vertex Cover in O(log\u03b4\/\u03b5 log log \u03b4) Rounds"],"prefix":"10.1145","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Keren","family":"Censor-Hillel","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Gregory","family":"Schwartzman","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"191","volume-title":"23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings","author":"\u00c5strand Matti","year":"2009","unstructured":"Matti \u00c5strand , Patrik Flor\u00e9en , Valentin Polishchuk , Joel Rybicki , Jukka Suomela , and Jara Uitto . A local 2-approximation algorithm for the vertex cover problem. In Distributed Computing , 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings , pages 191 -- 205 , 2009 . Matti \u00c5strand, Patrik Flor\u00e9en, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto. A local 2-approximation algorithm for the vertex cover problem. In Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pages 191--205, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810533"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010009"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.60"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/050625382"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2009","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . Introduction to Algorithms , Third Edition. The MIT Press , 3 rd edition, 2009 . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009."},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , 1979 . M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435381"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/06065310X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373121"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109666"},{"key":"e_1_3_2_1_17_1","volume-title":"Local computation: Lower and upper bounds. CoRR, abs\/1011.5470","author":"Kuhn Fabian","year":"2010","unstructured":"Fabian Kuhn , Thomas Moscibroda , and Roger Wattenhofer . Local computation: Lower and upper bounds. CoRR, abs\/1011.5470 , 2010 . Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. CoRR, abs\/1011.5470, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1036"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0127-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"e_1_3_2_1_22_1","volume-title":"Personal communication","author":"Pettie Seth","year":"2016","unstructured":"Seth Pettie . Personal communication . 2016 . Seth Pettie. Personal communication. 2016."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008932"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.12.003"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.02.017"}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:52Z","timestamp":1750268332000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":25,"alternative-id":["10.1145\/2933057.2933086","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933086","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}