{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:36Z","timestamp":1760441856071},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_37","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"431-441","source":"Crossref","is-referenced-by-count":0,"title":["Power Assignment in Radio Networks with Two Power Levels"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P. Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of Approximating Problems on Cubic Graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 288\u2013298. Springer, Heidelberg (1997)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Althaus, E., C\u01celinescu, G., M\u01cendoiu, I.I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-hoc Wireless Networks. In: Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889\u20131894 (2003)","DOI":"10.1109\/WCNC.2003.1200675"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 71\u201382 (2002)","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"C\u01celinescu, G., M\u01cendoiu, I.I., Zelikovsky, A.Z.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 119\u2013130 (2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Clementi, E.F., Crescenzi, P., Penna, P., Silvestri, R.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Sympos. Theoretical Aspects of Computer Science (STACS), pp. 121\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Clementi, E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The Minimum Range Assignment Problem on Linear Radio Networks. In: European Sympos. on Algorithms (ESA), pp. 143\u2013154 (2000)","DOI":"10.1007\/3-540-45253-2_14"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Clementi, E.F., 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: Int. Parallel and Distributed Processing Sympos, IPDPS (2003)","DOI":"10.1109\/IPDPS.2003.1213407"},{"key":"37_CR8","unstructured":"Clementi, E.F., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Electronic Colloquium on Computational Complexity (2000)"},{"key":"37_CR9","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, New York (1979)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BFb0023473","volume-title":"STACS 97","author":"L.M. Kirousis","year":"1997","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 363\u2013374. Springer, Heidelberg (1997)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"},{"key":"37_CR12","unstructured":"Papadimitriou, I., Georgiadis, L.: Energy-aware Broadcasting in Wireless Networks. In: Proc. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 267\u2013277 (2003)"},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Trans. computers\u00a030, 135\u2013140 (1981)","journal-title":"IEEE Trans. computers"},{"key":"37_CR14","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 Broadcast Routing in Static Ad Hoc Wireless Networks. ACM Wireless Networks\u00a08, 607\u2013617 (2002)","journal-title":"ACM Wireless Networks"},{"key":"37_CR15","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: IEEE INFOCOM, pp. 585\u2013594 (2000)","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1011478717164","volume":"6","author":"J.E. Wieselthier","year":"2001","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for Energy- Efficient Multicasting in Static Ad Hoc Wireless Networks. ACM Mobile Networks and Applications (MONET)\u00a06, 251\u2013263 (2001)","journal-title":"ACM Mobile Networks and Applications (MONET)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:11Z","timestamp":1620012431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}