{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:16Z","timestamp":1740099616678,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030344047"},{"type":"electronic","value":"9783030344054"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34405-4_6","type":"book-chapter","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T19:02:44Z","timestamp":1574103764000},"page":"96-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reception Capacity: Definitions, Game Theory and Hardness"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naomi","family":"Ephraim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: complexity and game theory. In: Proceedings of IEEE INFOCOM, pp. 1332\u20131340. IEEE (2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Asgeirsson, E.I., Mitra, P.: On a game theoretic approach to capacity maximization in wireless networks. In: Proceedings of IEEE INFOCOM, pp. 3029\u20133037. IEEE (2011). https:\/\/doi.org\/10.1109\/INFCOM.2011.5935146 . http:\/\/dx.doi.org\/10.1109\/INFCOM.2011.5935146","DOI":"10.1109\/INFCOM.2011.5935146"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 373\u2013382. ACM (2008)","DOI":"10.1145\/1374376.1374430"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I Chlamtac","year":"1991","unstructured":"Chlamtac, I.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39(3), 426\u2013433 (1991)","journal-title":"IEEE Trans. Commun."},{"issue":"12","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"E Demaine","year":"2008","unstructured":"Demaine, E., Feige, U., Hajiaghayi, M., Salavatipour, M.: Combination can be hard: approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Dinitz, M.: Distributed algorithms for approximating wireless network capacity. In: Proceedings of IEEE INFOCOM, pp. 1\u20139, March 2010. https:\/\/doi.org\/10.1109\/INFCOM.2010.5461905","DOI":"10.1109\/INFCOM.2010.5461905"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. J. Algorithms 52(1), 8\u201325 (2004)","journal-title":"J. Algorithms"},{"key":"6_CR11","unstructured":"Elkin, M., Kortsarz, G.: Improved schedule for radio broadcast. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 222\u2013231. Society for Industrial and Applied Mathematics (2005)"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1137\/S0895480104445319","volume":"19","author":"M Elkin","year":"2005","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Math. 19(4), 881\u2013899 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230140102","volume":"14","author":"S Even","year":"1984","unstructured":"Even, S., Goldreich, O., Moran, S., Tong, P.: On the np-completeness of certain network testing problems. Networks 14(1), 1\u201324 (1984)","journal-title":"Networks"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 534\u2013543. ACM, New York (2002). https:\/\/doi.org\/10.1145\/509907.509985 . http:\/\/doi.acm.org\/10.1145\/509907.509985","DOI":"10.1145\/509907.509985"},{"key":"6_CR15","unstructured":"Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents (2007)"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I Gaber","year":"2003","unstructured":"Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46(1), 1\u201320 (2003)","journal-title":"J. Algorithms"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 129\u2013137. ACM (2005)","DOI":"10.1145\/1073814.1073840"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/TNET.2013.2258036","volume":"22","author":"O Goussevskaia","year":"2014","unstructured":"Goussevskaia, O., Halld\u00f3rsson, M.M., Wattenhofer, R.: Algorithms for wireless capacity. IEEE\/ACM Trans. Netw. 22(3), 745\u2013755 (2014). https:\/\/doi.org\/10.1109\/TNET.2013.2258036 . http:\/\/dx.doi.org\/10.1109\/TNET.2013.2258036","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Goussevskaia, O., Wattenhofer, R., Halld\u00f3rsson, M.M., Welzl, E.: Capacity of arbitrary wireless networks. In: Proceedings of IEEE INFOCOM, pp. 1872\u20131880. IEEE (2009). https:\/\/doi.org\/10.1109\/INFCOM.2009.5062108 . http:\/\/dx.doi.org\/10.1109\/INFCOM.2009.5062108","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"6_CR20","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1538\u20131548. Society for Industrial and Applied Mathematics, Philadelphia (2011). http:\/\/dl.acm.org\/citation.cfm?id=2133036.2133155"},{"key":"6_CR21","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless connectivity and capacity. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 516\u2013526. Society for Industrial and Applied Mathematics, Philadelphia (2012). http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095160"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2013.09.035","volume":"553","author":"MM Halld\u00f3rsson","year":"2014","unstructured":"Halld\u00f3rsson, M.M., Mitra, P.: Wireless capacity with arbitrary gain matrix. Theor. Comput. Sci. 553, 57\u201363 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.09.035 . http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.09.035","journal-title":"Theor. Comput. Sci."},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Halldorsson, M.M., Tonoyan, T.: How well can graphs represent wireless interference? In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 635\u2013644 ACM, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746585 . http:\/\/doi.acm.org\/10.1145\/2746539.2746585","DOI":"10.1145\/2746539.2746585"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1549\u20131559. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.120 . http:\/\/dx.doi.org\/10.1137\/1.9781611973082.120","DOI":"10.1137\/1.9781611973082.120"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An $$\\omega $$(d$$\\backslash $$log(n\/d)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"6_CR26","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM 62(5), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2806883 . http:\/\/doi.acm.org\/10.1145\/2806883","journal-title":"J. ACM"},{"issue":"5","key":"6_CR27","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1002\/jgt.3190180506","volume":"18","author":"PM Weichsel","year":"1994","unstructured":"Weichsel, P.M.: Dominating sets in n-cubes. J. Graph Theory 18(5), 479\u2013488 (1994). https:\/\/doi.org\/10.1002\/jgt.3190180506 . http:\/\/dx.doi.org\/10.1002\/jgt.3190180506","journal-title":"J. Graph Theory"},{"issue":"6","key":"6_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(90)90031-R","volume":"35","author":"Chain-Chin Yen","year":"1990","unstructured":"Yen, C.C., Lee, R.: The weighted perfect domination problem. Inf. Process. Lett. 35(6), 295\u2013299 (1990). https:\/\/doi.org\/http:\/\/dx.doi.org\/10.1016\/0020-0190(90)90031-R . http:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909090031R","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34405-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:17:19Z","timestamp":1665015439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34405-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030344047","9783030344054"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34405-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 November 2019","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-algosensors\/algosensors-overview","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":"16","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":"11","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":"69% - 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","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","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)"}}]}}