{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:43Z","timestamp":1725474643300},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488224"},{"type":"electronic","value":"9783540488248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11922377_10","type":"book-chapter","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T11:21:13Z","timestamp":1165317673000},"page":"112-124","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The \u03b1\u2264d Case)"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[]},{"given":"Mia","family":"Persson","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Wahlen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_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":"10_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/177424.178029","volume-title":"Proc. 10th Annual ACM Symposium on Computational Geometry (SCG 1994)","author":"H. Bronnimann","year":"1994","unstructured":"Bronnimann, H., Goodrich, M.T.: Almost Optimal Set Covers in Finite VC-Dimension. In: Proc. 10th Annual ACM Symposium on Computational Geometry (SCG 1994), pp. 293\u2013302. ACM Press, New York (1994)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-39658-1_13","volume-title":"Algorithms - ESA 2003","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network Lifetime and Power Assignment in ad hoc Wireless Networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"key":"10_CR4","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.: 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)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1064092.1064115","volume-title":"Proc. 21st Annual ACM Symposium on Computational Geometry (SCG 2005)","author":"K.L. Clarksson","year":"2005","unstructured":"Clarksson, K.L., Varadarajan, K.: Improved Approximation Algorithms for Geometric Set Cover. In: Proc. 21st Annual ACM Symposium on Computational Geometry (SCG 2005), pp. 135\u2013141. ACM Press, New York (2005)"},{"key":"10_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.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":"10_CR7","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Manuscript"},{"key":"10_CR8","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE\u00a02002), pp. 23\u201338 (2002)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1022630.1022644","volume-title":"Proc. of the 2004 joint workshop on Foundations of mobile computing (DIALM-POMC 2004)","author":"M. Flammini","year":"2004","unstructured":"Flammini, M., Klasing, R., Navarra, A., P\u00e9rennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proc. of the 2004 joint workshop on Foundations of mobile computing (DIALM-POMC 2004), pp. 85\u201391. ACM Press, New York (2004)"},{"key":"10_CR10","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 and Company, New York (1979)"},{"volume-title":"Handbook of Discrete and Computational Geometry","year":"2004","key":"10_CR11","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Haas, Z., Tabrizi, S.: On Some Challenges and Design Choices in Ad-Hoc Communications. In: Proc. of the IEEE Military Communication Conference (MILCOM 1998), pp. 187\u2013192 (1998)","DOI":"10.1109\/MILCOM.1998.722569"},{"key":"10_CR13","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":"10_CR14","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":"10_CR15","first-page":"351","volume-title":"Routing in communication networks","author":"G.S. Lauer","year":"1995","unstructured":"Lauer, G.S.: Packet radio routing, ch.11. In: Streenstrup, M. (ed.) Routing in communication networks, pp. 351\u2013396. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"10_CR16","unstructured":"Li, G., Fan, P., Cai, K.: On the geometrical characteristics of three dimensional wireless ad-hoc networks and its applications. EURASIP Journal on Wireless Communications & Networking (to appear)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/513800.513815","volume-title":"Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc\u00a02002)","author":"W. Liang","year":"2002","unstructured":"Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc\u00a02002), pp. 112\u2013122. ACM Press, New York (2002)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/WIOPT.2005.51","volume-title":"Proc. 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2005)","author":"A. Navarra","year":"2005","unstructured":"Navarra, A.: Tighter bounds for the minimum energy broadcasting problem. In: Proc. 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2005), pp. 313\u2013322. IEEE Computer Society, Los Alamitos (2005)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc. 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 1162\u20131171 (2001)","DOI":"10.1109\/INFCOM.2001.916310"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proc. 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), pp. 585\u2013594 (2000)","DOI":"10.1109\/INFCOM.2000.832232"}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11922377_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:44:54Z","timestamp":1619509494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11922377_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488224","9783540488248"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11922377_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}