{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:36Z","timestamp":1725543816016},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_18","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"227-239","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E. F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Lauria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_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":"18_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A. Balakrishnan","year":"1992","unstructured":"Balakrishnan, A., Altinkemer, K.: Using a hop-constrained model to generate alternative communication network design. ORSA Journal of Computing\u00a04, 147\u2013159 (1992)","journal-title":"ORSA Journal of Computing"},{"key":"18_CR3","unstructured":"Calamoneri, T., Clementi, A., Di Ianni, M., Lauria, M., Monti, A., Silvestri, R.: Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks (Full Version), available at \n                  \n                    http:\/\/www.dsi.uniroma1.it\/calamo\/papers.html"},{"key":"18_CR4","unstructured":"C\u01celinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proc. of 20th IEEE INFOCOM, pp. 1162\u20131171 (April 2001)"},{"key":"18_CR5","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":"18_CR6","doi-asserted-by":"crossref","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: On the Approximation Ratio of the MST-based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In: Proc. of 3rd IEEE Intern. Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN 2003) (2003)","DOI":"10.1109\/IPDPS.2003.1213407"},{"key":"18_CR7","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Static Ad-Hoc in Wireless Networks. In: Proc. of 3rd Int. Workshop ARACNE, Carleton Scientific, pp. 23\u201338 (2002)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"A. Clementi","year":"2004","unstructured":"Clementi, A., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications (MONET)\u00a09, 125\u2013140 (2004)","journal-title":"Mobile Networks and Applications (MONET)"},{"key":"18_CR9","unstructured":"Crescenzi, P., Kann, V.: A Compendium of NP Optimization Problems, \n                  \n                    http:\/\/www.nada.kth.se\/viggo\/wwwcompendium\/"},{"key":"18_CR10","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of 19th IEEE INFOCOM, pp. 585\u2013594 (2000)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11427186_4","volume-title":"Experimental and Efficient Algorithms","author":"M. Flammini","year":"2005","unstructured":"Flammini, M., Navarra, A., P\u00e9r\u00e9nnes, S.: The \u201cReal\u201d Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 22\u201331. Springer, Heidelberg (2005)"},{"key":"18_CR12","first-page":"170","volume":"95","author":"L. Gouveia","year":"2001","unstructured":"Gouveia, L.: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop-constraint. European Journal of Operational Research\u00a095, 170\u2013190 (2001)","journal-title":"European Journal of Operational Research"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-314X(03)00015-5","volume":"100","author":"R.L. Graham","year":"2003","unstructured":"Graham, R.L., Lagarias, J.C., Mallows, C.L., Wilks, A.R., Yan, C.H.: Apollonian Circle Packings: Number Theory. J. Number Theory\u00a0100, 1\u201345 (2003)","journal-title":"J. Number Theory"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Haenggi, M.: Twelve Reasons not to Route over Many Short Hops. In: Proc. of IEEE Vehicular Technology Conference (VTC 2004 Fall)\u00a0(5), pp. 3130\u20133134 (2004)","DOI":"10.1109\/VETECF.2004.1404638"},{"key":"18_CR15","unstructured":"Hilbert, D., Cohn-Vossen, S.: Geometry and the Immagination, Chelsea, pp. 33\u201335 (1999)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation Schemes for Covering and Packing problems in Image Processing and VLSI. Journal of ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1112\/plms\/s3-60.3.471","volume":"60","author":"M.N. Huxley","year":"1990","unstructured":"Huxley, M.N.: Exponential sums and lattice points. Proc. London Math. Soc.\u00a060, 471\u2013502 (1990)","journal-title":"Proc. London Math. Soc."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. Journal of Algorithms\u00a039, 47\u201367 (2001)","journal-title":"Journal of Algorithms"},{"key":"18_CR20","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Chichester (1995)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1103\/PhysRevA.46.1859","volume":"46","author":"B. S\u00f6derberg","year":"1992","unstructured":"S\u00f6derberg, B.: Apollonian Tiling, the Lorentz Group, and Regular Trees. Physical Review A\u00a046, 1859\u20131866 (1992)","journal-title":"Physical Review A"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S. Voss","year":"1999","unstructured":"Voss, S.: The steiner tree problem with hop constraint. Annals of Operations Research\u00a086, 321\u2013345 (1999)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T20:48:45Z","timestamp":1552337325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11780823_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}