{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:45Z","timestamp":1725573285192},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_14","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"115-126","source":"Crossref","is-referenced-by-count":7,"title":["Gathering Algorithms on Paths Under Interference Constraints"],"prefix":"10.1007","author":[{"given":"Jean-Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Corr\u00eaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minli","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","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 (March 2006)","DOI":"10.1142\/S0129626406002551"},{"key":"14_CR2","unstructured":"Bermond, J.-C., Peters, J.: Efficient gathering in radio ids with interference. In: AlgoTel 2005, Presqu\u2019le de Giens, May 2005, pp. 103\u2013106 (2005)"},{"key":"14_CR3","first-page":"16","volume":"22","author":"P. Bertin","year":"2005","unstructured":"Bertin, P., Bresse, J.-F., Le Sage, B.: Accs haut dbit en zone rurale: une solution \u201dad hoc\u201d. France Telecom R&D\u00a022, 16\u201318 (2005)","journal-title":"France Telecom R&D"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45465-9_33","volume-title":"Automata, Languages and Programming","author":"M. Christersson","year":"2002","unstructured":"Christersson, M., Gasieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 377\u2013389. Springer, Heidelberg (2002)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M. Chrobak","year":"2002","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms\u00a043(2), 177\u2013189 (2002)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M.L. Elkin","year":"2004","unstructured":"Elkin, M.L., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. Journal of Algorithms\u00a052(1), 8\u201325 (2004)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"14_CR7","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. Journal of Algorithms\u00a046(1), 1\u201320 (2003)","journal-title":"Journal of Algorithms"},{"key":"14_CR8","first-page":"193","volume-title":"Proceedings of the IFIP 17th World Computer Congress","author":"L. Gasieniec","year":"2002","unstructured":"Gasieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proceedings of the IFIP 17th World Computer Congress, pp. 193\u2013205. Kluwer, B.V (2002)"},{"key":"14_CR9","unstructured":"Klasing, R., Morales, N., P\u00e9rennes, S.: On the complexity of bandwidth allocation in radio networks with ste ady traffic demands. Technical report, INRIA Research Report RR-5432 and I3S Research Report I3S\/RR-2 004-40-FR (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:18Z","timestamp":1619507058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11758471_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}