{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:37Z","timestamp":1725543817736},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_19","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"240-252","source":"Crossref","is-referenced-by-count":6,"title":["3-D Minimum Energy Broadcasting"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Navarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"585","volume-title":"Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)","author":"J.E. Wieselthier","year":"2000","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 585\u2013594. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-36136-7_30","volume-title":"Algorithms and Computation","author":"I. Caragiannis","year":"2002","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New results for energy-efficient broadcasting in wireless networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 332\u2013343. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"299","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Ianni, M.D., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science\u00a0299(1-3), 751\u2013761 (2003)","journal-title":"Theoretical Computer Science"},{"key":"19_CR4","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.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., 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":"19_CR5","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":"19_CR6","doi-asserted-by":"crossref","unstructured":"Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved approximation results for the Minimum Energy Broadcasting Problem. In: Proceedings of ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 85\u201391 (2004) (to appear on the associated Special Issue of Algorithmica)","DOI":"10.1145\/1022630.1022644"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Flammini, M., Navarra, A., Perennes, 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) (to appear on the associated Special Issue of Journal of Experimental Algorithmics)","DOI":"10.1007\/11427186_4"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/978-3-540-24693-0_71","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"R. Klasing","year":"2004","unstructured":"Klasing, R., Navarra, A., Papadopoulos, A., P\u00e9r\u00e9nnes, S.: Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 866\u2013877. Springer, Heidelberg (2004)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Navarra, A.: Tighter bounds for the Minimum Energy Broadcasting problem. In: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 313\u2013322 (2005)","DOI":"10.1109\/WIOPT.2005.51"},{"issue":"6","key":"19_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., Calinescu, G., Li, X., Frieder, O.: Minimum energy broadcasting in static ad hoc wireless networks. Wireless networks\u00a08(6), 607\u2013617 (2002)","journal-title":"Wireless networks"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking and computing (MOBIHOC), pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"},{"key":"19_CR12","volume-title":"Sphere Packings, Lattices, and Groups, Ch.\u00a02.1 and Ch.\u00a013","author":"J.H. Conway","year":"1998","unstructured":"Conway, J.H., Sloane, N.J.A.: The Kissing Number Problem and Bounds on Kissing Numbers. In: Sphere Packings, Lattices, and Groups, Ch.\u00a02.1 and Ch.\u00a013, 3rd edn., Springer, New York (1998)","edition":"3"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF02125348","volume":"9","author":"A.M. Frieze","year":"1989","unstructured":"Frieze, A.M., McDiarmid, C.J.H.: On Random Minimum Length Spanning Trees. Combinatorica\u00a09, 363\u2013374 (1989)","journal-title":"Combinatorica"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Attali, D., Boissonnat, J.D.: A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces. In: Proceedings of the 7th ACM symposium on Solid modeling and applications (SMA), pp. 139\u2013146 (2002)","DOI":"10.1145\/566282.566304"},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/38.403829","volume":"15","author":"T.P. Fang","year":"1995","unstructured":"Fang, T.P., Piegl, L.A.: Delaunay triangulation in three dimensions. IEEE Computer Graphics and Applications\u00a015(5), 62\u201369 (1995)","journal-title":"IEEE Computer Graphics and Applications"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-28634-9_15","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"S. Athanassopoulos","year":"2004","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol.\u00a03158, pp. 183\u2013196. Springer, Heidelberg (2004)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Energy-efficient broadcasting in ad-hoc networks: combining msts with shortest-path trees. In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless, Ad Hoc, Sensor and Ubiquitous Networks (PE-WASUN), pp. 61\u201368 (2004)","DOI":"10.1145\/1023756.1023769"},{"key":"19_CR18","unstructured":"Yuan, D.: Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks. In: Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 323\u2013331 (2005)"},{"key":"19_CR19","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: Proceedings of the 3rd IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), p. 222 (2003)","DOI":"10.1109\/IPDPS.2003.1213407"}],"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_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:11Z","timestamp":1619507831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11780823_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}