{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:55:21Z","timestamp":1743105321446,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19754-3_19","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:22:38Z","timestamp":1301289758000},"page":"181-192","source":"Crossref","is-referenced-by-count":0,"title":["Multi-channel Assignment for Communication in Radio Networks"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz A.","family":"Rokicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_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. Journal of Computer and System Sciences\u00a043, 290\u2013298 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1109\/TC.1987.1676861","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"Chlamtac, I., Kutten, S.: Tree-based broadcasting in multihop radio networks. IEEE Transactions on Computers\u00a036, 1209\u20131223 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR3","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 networks. IEEE Trans. on Communications\u00a039, 426\u2013433 (1991)","journal-title":"IEEE Trans. on Communications"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s00453-007-9136-0","volume":"54","author":"F. Cicalese","year":"2009","unstructured":"Cicalese, F., Manne, F., Xin, Q.: Faster deterministic communication in radio networks. Algorithmica\u00a054, 226\u2013242 (2009)","journal-title":"Algorithmica"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks, in. In: Proc., 12ve Annual Symposium on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"19_CR6","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\u00a052, 8\u201325 (2004)","journal-title":"J. Algorithms"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"19_CR8","unstructured":"Fussen, M., Wattenhofer, R., Zollinger, A.: Interference arises at the receiver. In: Proc., Int. Con. on Wireless Networks, Communications, and Mobile Computing, WIRELESSCOM (2005)"},{"key":"19_CR9","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":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc., 24th ACM Symp. on Principles of Distributed Computing (PODC), pp. 129-137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halldorsson, M., Wattenhofer, R., Welzl, E.: Capacity of arbitrary wireless networks. In: Proc., 28th IEEE Conference on Computer Communications (INFOCOM) (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. 8th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02927-1_44","volume-title":"Automata, Languages and Programming","author":"M. Halldorsson","year":"2009","unstructured":"Halldorsson, M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 525\u2013536. Springer, Heidelberg (2009)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D.R. Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing\u00a019, 185\u2013195 (2007)","journal-title":"Distributed Computing"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-15763-9_32","volume-title":"Distributed Computing","author":"D.R. Kowalski","year":"2010","unstructured":"Kowalski, D.R., Rokicki, M.A.: Connectivity problem in wireless networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 344\u2013358. Springer, Heidelberg (2010)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Moscibroda, T.: The worst-case capacity of wireless sensor networks. In: Proc., 6th Int. Conf. on Information Processing in Sensor Networks (IPSN), pp. 1\u201310 (2007)","DOI":"10.1145\/1236360.1236362"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In Proc., 25th IEEE Conference on Computer Communications (INFOCOM), pp. 1\u201313 (2006)","DOI":"10.1109\/INFOCOM.2006.23"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:21:57Z","timestamp":1558513317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}