{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:11Z","timestamp":1759637651467},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_13","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"114-126","source":"Crossref","is-referenced-by-count":80,"title":["Network Lifetime and Power Assignment in ad hoc Wireless Networks"],"prefix":"10.1007","author":[{"given":"Gruia","family":"Calinescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjiv","family":"Kapoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Olshevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Wan, P., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast in static ad hoc wireless networks. Wireless Networks (2002)","DOI":"10.1023\/A:1020381720601"},{"key":"13_CR2","first-page":"119","volume-title":"Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002)","author":"G. Calinescu","year":"2002","unstructured":"Calinescu, G., Mandoiu, I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Baeza-Yates, R., Montaniri, U., Santoro, N. (eds.) Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 119\u2013130. Kluwer Academic Publ., Dordrecht (2002)"},{"key":"13_CR3","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of FOCS (1997)"},{"key":"13_CR4","unstructured":"Cardei, D.-Z.D.M.: Improving wireless sensor network lifetime through power aware organization. Submitted to ACM Wireless Networks"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: IEEE International Conference on Communications (ICC), Helsinki, June 2001, pp. 472\u2013476 (2001)","DOI":"10.1109\/ICC.2001.936985"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Zussman, G., Segall, A.: Energy efficient routing in ad hoc disaster recovery networks. In: IEEE INFOCOM 2003 (2003)","DOI":"10.1109\/INFCOM.2003.1208718"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"6","author":"F. Leighton","year":"1999","unstructured":"Leighton, F., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM\u00a06, 787\u2013832 (1999)","journal-title":"Journal of the ACM"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W. Chen","year":"1989","unstructured":"Chen, W., Huang, N.: The strongly connecting problem on multihop packet radio networks. IEEE Transactions on COmmunications\u00a037, 293\u2013295 (1989)","journal-title":"IEEE Transactions on COmmunications"},{"key":"13_CR9","doi-asserted-by":"crossref","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); preliminary version in STACS 1997","journal-title":"Theoretical Computer Science"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, E., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity, vol. Report TR00-054 (2000); preliminary results in APPROX 1999 and STACS 2000","DOI":"10.1007\/3-540-46541-3_54"},{"key":"13_CR11","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":"13_CR12","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New results for energyefficient broadcasting in wireless networks. In: ISAAC 2002, pp. 332\u2013343 (2002)","DOI":"10.1007\/3-540-36136-7_30"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment in ad-hoc wireless networks. In: WCNC 2003, pp. 1889\u20131894 (2003)","DOI":"10.1109\/WCNC.2003.1200675"},{"key":"13_CR14","first-page":"71","volume-title":"2nd IFIP International Conference on Theoretical Computer Science (TCS 2002)","author":"D. Blough","year":"2002","unstructured":"Blough, D., Leoncini, M., Resta, G., Santi, P.: On the symmetric range assignment problem in wireless ad hoc networks. In: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), pp. 71\u201382. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"13_CR15","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: 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) (2002)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for nodeweighted steiner trees. Journal of Algorithms\u00a019, 104\u2013115 (1995)","journal-title":"Journal of Algorithms"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set covering problem. Mathematics of Operation Research\u00a04, 233\u2013235 (1979)","journal-title":"Mathematics of Operation Research"},{"key":"13_CR19","unstructured":"K\u00f6nneman, J.: Personal communication"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation\u00a0150, 57\u201374 (1999)","journal-title":"Information and Computation"},{"key":"#cr-split#-13_CR21.1","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979);"},{"key":"#cr-split#-13_CR21.2","doi-asserted-by":"crossref","unstructured":"Numerische Mathematik, vol. 1, pp. 269\u2013271 (1960)","DOI":"10.1007\/BF01386390"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: MOBIHOC 2002, pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T13:00:22Z","timestamp":1559307622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}