{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:51Z","timestamp":1725561351126},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_60","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"585-594","source":"Crossref","is-referenced-by-count":6,"title":["Energy-Efficient Wireless Network Design"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","first-page":"1889","volume-title":"Proc. of the IEEE Wireless Communications and Networking Conference (WCNC 2003)","author":"E. Althaus","year":"2003","unstructured":"Althaus, E., C\u01celinescu, G., M\u01cendoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-Hoc Wireless Networks. In: Proc. of the IEEE Wireless Communications and Networking Conference (WCNC 2003), pp. 1889\u20131894. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"60_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 200\u2013209. Springer, Heidelberg (1999)"},{"key":"60_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. C\u01celinescu","year":"2003","unstructured":"C\u01celinescu, 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) (to appear)"},{"key":"60_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., 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","key":"60_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms\u00a033(1), 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"key":"60_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Algorithm Theory - SWAT 2002","author":"M. Chleb\u00edk","year":"2002","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation Hardness of the Steiner Tree Problem on Graphs. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 170\u2013179. Springer, Heidelberg (2002)"},{"key":"60_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (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: Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001). LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"60_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM\/APPROX 1999)","author":"A.E.F. Clementi","year":"1999","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In: Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM\/APPROX 1999). LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"60_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum Branchings. Journal of Research of the National Bureau of Standards\u00a071B, 233\u2013240 (1967)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"60_CR11","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(1), 57\u201374 (1999)","journal-title":"Information and Computation"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic Inapproximability. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 585\u2013 594 (2003)","DOI":"10.1145\/780542.780628"},{"issue":"1-2","key":"60_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(1-2), 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: Proc. of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"},{"key":"60_CR15","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximations in Graphs. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770\u2013779 (2000)"},{"issue":"6","key":"60_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P.-J. Wan","year":"2002","unstructured":"Wan, P.-J., C\u01celinescu, G., Li, X.-Y., Frieder, O.: Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks\u00a08(6), 607\u2013617 (2002)","journal-title":"Wireless Networks"},{"key":"60_CR17","unstructured":"Zosin, L., Khuller, S.: On Directed Steiner Trees. In: Proc. of the 13th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 59\u201363 (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T12:27:35Z","timestamp":1552825655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}