{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:42:27Z","timestamp":1742978547571,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_234","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"528-531","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Energy Cost Broadcasting in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"234_CR1_234","first-page":"1139","volume-title":"Proceedings of 32th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3580","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: Proceedings of 32th International Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol.\u00a03580, pp.\u00a01139\u20131150 (2005)"},{"key":"234_CR2_234","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X. Cheng","year":"2003","unstructured":"Cheng, X., Huang, X., Li, D., Du, D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Netw. 42, 202\u2013208 (2003)","journal-title":"Netw."},{"issue":"3","key":"234_CR3_234","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A\u00a0Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"234_CR4_234","doi-asserted-by":"crossref","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: 18th Annual Symposium on Theoretical Aspects of Computer Science. LNCS, vol.\u00a02010, pp.\u00a0121\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"234_CR5_234","volume-title":"Introduction to Algorithms","author":"T.J. Cormen","year":"1990","unstructured":"Cormen, T.J., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press and McGraw-Hill, Columbus (1990)"},{"key":"234_CR6_234","volume-title":"Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC, pp. 85\u201391","author":"M. Flammini","year":"2004","unstructured":"Flammini, M., Navarra, A., Klasing, R., P\u00e9rennes, A.: Improved approximation results for the minimum energy broadcasting problem. DIALM-POMC, pp.\u00a085\u201391. ACM Press, New York (2004)"},{"key":"234_CR7_234","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\u00a0Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"234_CR8_234","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20, 347\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"234_CR9_234","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, New York (1985)"},{"key":"234_CR10_234","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, IEEE Press, Piscataway (1996)"},{"key":"234_CR11_234","doi-asserted-by":"crossref","unstructured":"Singh, S., Raghavendra, C.S., Stepanek, J.: Power-Aware Broadcasting in Mobile Ad Hoc Networks. In: Proceedings of IEEE PIMRC'99, Osaka, September 1999","DOI":"10.1145\/288235.288286"},{"issue":"6","key":"234_CR12_234","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for steiner problem in graphs. Mathematica Japonica 24(6), 573\u2013577 (1980)","journal-title":"Math. Jap."},{"key":"234_CR13_234","unstructured":"Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. ACM Wirel. Netw. Preliminary version appeared in IEEE INFOCOM (2000)8(6), 607\u2013617 (2002)"},{"key":"234_CR14_234","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TNET.2004.828940","volume":"12","author":"P.-J. Wan","year":"2004","unstructured":"Wan, P.-J., Calinescu, G., Yi, C.-W.: Minimum-power multicast routing in static ad hoc wireless networks. IEEE\/ACM Trans. Netw. 12, 507\u2013514 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"234_CR15_234","first-page":"585","volume":"2","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. IEEE Infocom 2, 585\u2013594 (2000)","journal-title":"IEEE Infocom"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:17:57Z","timestamp":1662175077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_234"}},"subtitle":["2001; Wan, Calinescu, Li, Frieder"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_234","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}