{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:27Z","timestamp":1725559167185},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260523"},{"type":"electronic","value":"9783540320739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11429647_6","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:18:25Z","timestamp":1279045105000},"page":"49-64","source":"Crossref","is-referenced-by-count":1,"title":["Range Augmentation Problems in Static Ad-Hoc Wireless Networks"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Althaus, E., C\u0103linescu, G., Mandoiu, I.I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. In: Wireless Networks, Availble on-line at \n                  \n                    http:\/\/www.mpi-sb.mpg.de\/~althaus\/winet.pdf\n                  \n                  \n                 (accepted for publication)"},{"key":"6_CR2","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\u0103linescu","year":"2003","unstructured":"C\u0103linescu, 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":"6_CR3","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., M\u0103ndoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proc. of the 2nd IFIP Int. Conf. on Theoretical Computer Science, Montreal (August 2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., Wan, P.-J.: Range assignment for high connectivity in wireless ad-hoc networks. In: Proc. of the 2nd International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-MWN 2003), pp. 235\u2013246 (2003)","DOI":"10.1007\/978-3-540-39611-6_21"},{"key":"6_CR5","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 Transaction on Communications\u00a037, 293\u2013295 (1989)","journal-title":"IEEE Transaction on Communications"},{"key":"6_CR6","unstructured":"Chu, T., Nikolaidis, I.: Energy efficient broadcast in mobile ad-hoc networks. In: Proc. of the 1st Int. Conf. on Ad-Hoc Networks and Wireless (ADHOC-NOW 2002), Toronto, Canada, September 20-21, pp. 177\u2013190 (2002)"},{"key":"6_CR7","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":"6_CR8","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. In: Electronic Colloquium on Computational Complexity, ECCC 2000 (2000)"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM Journal on Computing\u00a05(4), 653\u2013665 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A treshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1j\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"6_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 (1998)","DOI":"10.1109\/MILCOM.1998.722569"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In: Proc. of the 9th Annual International Conference on Mobile Computing and Networking (MOBICOM 2003), pp. 300\u2013312 (2003)","DOI":"10.1145\/938985.939016"},{"key":"6_CR14","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S. Khuller","year":"1996","unstructured":"Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1996)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Ragavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms\u00a021, 433\u2013450 (1996)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximation and graph carvings. Journal of the ACM\u00a041(2), 214\u2013235 (1994)","journal-title":"Journal of the ACM"},{"key":"6_CR17","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"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00453-003-1027-4","volume":"37","author":"G. Kortsarz","year":"2003","unstructured":"Kortsarz, G., Nutov, Z.: Approximating node connectivity problems via set covers. Algorithmica\u00a037(2), 75\u201392 (2003)","journal-title":"Algorithmica"},{"key":"6_CR19","volume-title":"Routing in Communication Networks","author":"G.S. Lauer","year":"1995","unstructured":"Lauer, G.S.: Packet radio routing. In: Streenstup, M. (ed.) Routing in Communication Networks. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proc. 3rd ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), pp. 112\u2013122 (2002)","DOI":"10.1145\/513800.513815"},{"key":"6_CR21","volume-title":"Wireless Communications: Principles and Practices","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Englewood Cliffs (1996)"},{"key":"6_CR22","unstructured":"Rossi, G.: The Range Assignment Problem in Static Ad-Hoc Wireless Networks, Universit\u00e0 di Roma \u201cTor Vergata\u201d, Ph.D. Thesis (2003)"},{"key":"6_CR23","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., C\u0103linescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast routing in static ad hoc wireless networks. In: Proc. of the IEEE Conf. on Computer Communications (INFOCOM 2001), vol.\u00a02, pp. 1162\u20131171 (2001)","DOI":"10.1109\/INFCOM.2001.916310"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11429647_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:38Z","timestamp":1619507438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11429647_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260523","9783540320739"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11429647_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}