{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T21:06:55Z","timestamp":1762808815230,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"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":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331577","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"104-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Distributed Covering Algorithms"],"prefix":"10.1145","author":[{"given":"Ran","family":"Ben Basat","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Even","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Schwartzman","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813191"},{"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.1145\/3060294"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087806"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"R. Ben-Basat G. Even K. Kawarabayashi and G. Schwartzman. 2019. Optimal Distributed Covering Algorithms. Vol. abs\/1902.09377 (2019).  R. Ben-Basat G. Even K. Kawarabayashi and G. Schwartzman. 2019. Optimal Distributed Covering Algorithms. Vol. abs\/1902.09377 (2019).","DOI":"10.1145\/3293611.3331577"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R. Ben-Basat G. Even K.-i. Kawarabayashi and G. Schwartzman. 2018. A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log \u0394 \/ log 2 log \u0394) Rounds. SIROCCO.  R. Ben-Basat G. Even K.-i. Kawarabayashi and G. Schwartzman. 2018. A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log \u0394 \/ log 2 log \u0394) Rounds. SIROCCO.","DOI":"10.1007\/978-3-030-01325-7_21"},{"key":"e_1_3_2_1_7_1","unstructured":"Guy Even Mohsen Ghaffari and Moti Medina. 2018. Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. In DISC.  Guy Even Mohsen Ghaffari and Moti Medina. 2018. Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. In DISC."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari. 2016. An improved distributed algorithm for maximal independent set. In SODA.   Mohsen Ghaffari. 2016. An improved distributed algorithm for maximal independent set. In SODA.","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Hsin-Hao Su. 2017. Distributed Degree Splitting Edge Coloring and Orientations. In SODA.   Mohsen Ghaffari and Hsin-Hao Su. 2017. Distributed Degree Splitting Edge Coloring and Orientations. In SODA.","DOI":"10.1137\/1.9781611974782.166"},{"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\/0211045"},{"key":"e_1_3_2_1_12_1","unstructured":"Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations.  Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1036"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0127-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn Thomas Moscibroda and Roger Wattenhofer. 2006. The price of being near-sighted. In SODA.   Fabian Kuhn Thomas Moscibroda and Roger Wattenhofer. 2006. The price of being near-sighted. In SODA.","DOI":"10.1145\/1109557.1109666"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008932"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.02.017"}],"event":{"name":"PODC '19: 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":"Toronto ON Canada","acronym":"PODC '19"},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:01Z","timestamp":1750208521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":18,"alternative-id":["10.1145\/3293611.3331577","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331577","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}