{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:44:52Z","timestamp":1743155092355,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892395"},{"type":"electronic","value":"9783030892401"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89240-1_7","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"94-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beep-And-Sleep: Message and Energy Efficient Set Cover"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"G\u00f6tte","sequence":"first","affiliation":[]},{"given":"Christina","family":"Kolb","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Werthmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Basat, R., Even, G., Kawarabayashi, K.I., Schwartzman, G.: Optimal distributed covering algorithms. In: Robinson, P., Ellen, F. (eds.) Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, 29 July \u2013 2 August 2019, pp. 104\u2013106. ACM (2019)","DOI":"10.1145\/3293611.3331577"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15763-9_15","volume-title":"Distributed Computing","author":"A Cornejo","year":"2010","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148\u2013162. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_15"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-662-45174-8_33","volume-title":"Distributed Computing","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Indyk, P., Mahabadi, S., Vakilian, A.: On streaming and communication complexity of the set cover problem. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 484\u2013498. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_33"},{"key":"7_CR4","unstructured":"Dufoulon, F., Burman, J., Beauquier, J.: Beeping a deterministic time-optimal leader election. In: Proceedings of the 32nd International Symposium on Distributed Computing (DISC 2018), volume 121 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 20:1\u201320:17, Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"7_CR5","unstructured":"Gmyr, R., Pandurangan, G.: Time-message trade-offs in distributed algorithms. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, 15\u201319 October 2018, volume 121 of LIPIcs, pp. 32:1\u201332:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Grunau, C., Mitrovic, S., Rubinfeld, R., Vakilian, A.: Improved local computation algorithm for set cover via sparsification. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5\u20138 January 2020, pp. 2993\u20133011. SIAM (2020)","DOI":"10.1137\/1.9781611975994.181"},{"key":"7_CR7","unstructured":"G\u00f6tte, T., Kolb, C., Scheideler, C., Werthmann, J.: Beep-and-sleep: Message and energy efficient set cover (2021). http:\/\/arxiv.org\/abs\/2107.14570arXiv:2107.14570"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Rubinfeld, R., Vakilian, A., Yodpinyanee, A.: Set cover in sub-linear time. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2467\u20132486. SIAM (2018)","DOI":"10.1137\/1.9781611975031.158"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00446-002-0078-0","volume":"15","author":"L Jia","year":"2002","unstructured":"Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15(4), 193\u2013205 (2002)","journal-title":"Distrib. Comput."},{"key":"7_CR10","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 980\u2013989. ACM Press (2006). http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109666"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, 13\u201316 July 2003, pp. 25\u201332. ACM (2003)","DOI":"10.1145\/872035.872040"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Peng, R., Vladu, A., Xu, S.C.: Improved parallel algorithms for spanners and hopsets. In: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, 13\u201315 June 2015, pp. 192\u2013201. ACM (2015)","DOI":"10.1145\/2755573.2755574"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, USA (2000)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A., Santi, P.: An o(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, 26\u201330 May 2008, pp. 91\u2013100. ACM (2008)","DOI":"10.1145\/1374618.1374632"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Yu, J., Jia, L., Yu, D., Li, G., Cheng, X.: Minimum connected dominating set construction in wireless networks under the beeping model. In: 2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, 26 April \u2013 1 May 2015, pp. 972\u2013980. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218469"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:59:03Z","timestamp":1634623143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}