{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:50:04Z","timestamp":1725519004258},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852087"},{"type":"electronic","value":"9783540852094"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85209-4_36","type":"book-chapter","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T17:29:57Z","timestamp":1221845397000},"page":"451-462","source":"Crossref","is-referenced-by-count":0,"title":["Request Satisfaction Problem in Synchronous Radio Networks"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Darties","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Durand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Palaysi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"36_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.\u00a043(2), 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., P\u00e9rennes, S.: Hardness and approximation of gathering in static radio networks. In: FAWN 2006, Pisa, Italy (2006)","key":"36_CR2","DOI":"10.1142\/S0129626406002551"},{"unstructured":"Bermond, J.-C., Peters, J.: Efficient gathering in radio grids with interference. In: Septi\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications (AlgoTel 2005), May 2005, pp. 103\u2013106 (2005)","key":"36_CR3"},{"unstructured":"Chelius, G.: Architectures et Communications dans les r\u00e9seaux spontan\u00e9s sans fil. PhD thesis, INSA de Lyon, INRIA Rh\u00f4ne Alpes, France (April 2004)","key":"36_CR4"},{"key":"36_CR5","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 Transactions on Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio network. IEEE Transaction Communication\u00a0(39), 426\u2013433 (1991)","journal-title":"IEEE Transaction Communication"},{"unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. Dunod (2001)","key":"36_CR7"},{"unstructured":"Darties, B.: Probl\u00e9mes algorithmiques et de complexit\u00e9 dans les r\u00e9seaux sans fil. PhD thesis, LIRMM, Universit\u00e9 Montpellier 2, France (December 2007)","key":"36_CR8"},{"unstructured":"Darties, B., Palaysi, J.: Satisfaction de requ\u00eates par affectation de dates d\u2019\u00e9missions dans les r\u00e9seaux radios. In: Rencontres francophones du Parall\u00e9lisme (RenPar\u201917), pp. 157\u2013163 (2006)","key":"36_CR9"},{"doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. In: Proceedings of the international workshop on Broadcasting and gossiping, pp. 79\u2013133. Elsevier North-Holland, Inc. (1994)","key":"36_CR10","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"36_CR11","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1986","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks\u00a018, 319\u2013349 (1986)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: APPROX-RANDOM, pp. 171\u2013182 (2004)","key":"36_CR13","DOI":"10.1007\/978-3-540-27821-4_16"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile and Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85209-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:47:46Z","timestamp":1558280866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85209-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540852087","9783540852094"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85209-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}