{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:09:08Z","timestamp":1725890948055},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169878"},{"type":"electronic","value":"9783642169885"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16988-5_4","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T03:14:03Z","timestamp":1287803643000},"page":"34-46","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Energy Broadcast on Rectangular Grid Wireless Networks"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Murata","sequence":"first","affiliation":[]},{"given":"Akira","family":"Matsubayashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1139\u20131150. Springer, Heidelberg (2005)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01838194","volume":"9","author":"D.W. Boyd","year":"1973","unstructured":"Boyd, D.W.: Improved bounds for the disk-packing constant. Aequationes Math.\u00a09, 99\u2013106 (1973)","journal-title":"Aequationes Math."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1112\/S0025579300004745","volume":"20","author":"D.W. Boyd","year":"1973","unstructured":"Boyd, D.W.: The residual set dimension of the Apollonian packing. Mathematika\u00a020, 170\u2013174 (1973)","journal-title":"Mathematika"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2008.02.005","volume":"399","author":"T. Calamoneri","year":"2008","unstructured":"Calamoneri, T., Clementi, A., Ianni, M.D., Lauria, M., Monti, A., Silvestri, R.: Minimum-energy broadcast and disk cover in grid wireless networks. Theoret. Comput. Sci.\u00a0399, 38\u201353 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-73420-8_40","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2007","unstructured":"Caragiannis, I., Flammini, M., Moscardelli, L.: An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 447\u2013458. Springer, Heidelberg (2007)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A. Clementi","year":"2001","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00453-007-9077-7","volume":"49","author":"M. Flammini","year":"2007","unstructured":"Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. Algorithmica\u00a049, 318\u2013336 (2007)","journal-title":"Algorithmica"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11276-006-0007-4","volume":"14","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Tightening the upper bound for the minimum energy broadcasting. Wireless Networks\u00a014, 659\u2013669 (2008)","journal-title":"Wireless Networks"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/0471738646","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"2005","unstructured":"Pahlavan, K., Levesque, A.H.: Wireless Information Networks, 2nd edn. Wiley-Interscience, Hoboken (2005)","edition":"2"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P.J. Wan","year":"2002","unstructured":"Wan, P.J., C\u0103linescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks\u00a08, 607\u2013617 (2002)","journal-title":"Wireless Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16988-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T18:04:44Z","timestamp":1553191484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16988-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169878","9783642169885"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16988-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}