{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:27:55Z","timestamp":1742380075166},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117220"},{"type":"electronic","value":"9783642117237"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11723-7_26","type":"book-chapter","created":{"date-parts":[[2010,1,22]],"date-time":"2010-01-22T08:30:55Z","timestamp":1264149055000},"page":"392-406","source":"Crossref","is-referenced-by-count":3,"title":["Exact Models for the k-Connected Minimum Energy Problem"],"prefix":"10.1007","author":[{"given":"Christina","family":"Burt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao-ban","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikki","family":"Sonenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E. Althaus","year":"2006","unstructured":"Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Networks\u00a012, 287\u2013299 (2006)","journal-title":"Wireless Networks"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1374718.1374722","volume-title":"Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing","author":"D. Berend","year":"2008","unstructured":"Berend, D., Segal, M., Shpungin, H.: Power efficient resilience and lifetime in wireless ad-hoc networks. In: Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, pp. 17\u201324. ACM, New York (2008)"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/570645.570667","volume-title":"Proceedings of the 8th annual international conference on Mobile computing and networking","author":"M. Cagalj","year":"2002","unstructured":"Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues. In: Proceedings of the 8th annual international conference on Mobile computing and networking, pp. 172\u2013182. ACM, New York (2002)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Wan, P.-J.: Range assignment for high connectivity in wireless ad hoc networks. In: Proc. International Conference on Ad hoc and Wireless Networks, pp. 235\u2013246 (2003)","DOI":"10.1007\/978-3-540-39611-6_21"},{"key":"26_CR5","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. of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE). Proceedings in Informatics, vol.\u00a015, pp. 23\u201338. Carleton Scientific (2002)"},{"key":"26_CR6","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":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","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: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"A. Clementi","year":"2004","unstructured":"Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Networks and Applications\u00a09, 125\u2013140 (2004)","journal-title":"Mobile Networks and Applications"},{"key":"26_CR8","first-page":"1001","volume-title":"INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies","author":"A. Das","year":"2003","unstructured":"Das, A., Marks, R., El-Sharkaw, M., Arabshahi, P., Gray, A.: Minimum power broadcast trees for wireless networks: Integer programming formulations. In: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a02, pp. 1001\u20131010. IEEE, Los Alamitos (2003)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0196-6774(02)00223-7","volume":"45","author":"T. Hsu","year":"2002","unstructured":"Hsu, T.: Simpler and faster biconnectivity augmentation. Journal of Algorithms\u00a045, 55\u201371 (2002)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10878-005-6858-2","volume":"9","author":"X. Jia","year":"2005","unstructured":"Jia, X., Kim, D., Makki, S., Wan, P.-J., Yi, C.-W.: Power assignment for kconnectivity in wireless ad hoc networks. Journal of Combinatorial Optimization\u00a09(2), 213\u2013222 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"2891","DOI":"10.1016\/j.cor.2004.04.017","volume":"32","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers and Operations Research\u00a032, 2891\u20132904 (2005)","journal-title":"Computers and Operations Research"},{"key":"26_CR13","volume-title":"Optimisation, Econometric and Financial Analysis, Part 1","author":"A. Orman","year":"2007","unstructured":"Orman, A., Williams, H.: Survey of different integer programming formulations of the travelling salesman problem. In: Optimisation, Econometric and Financial Analysis, Part 1. Springer, Berlin (2007)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.adhoc.2008.03.008","volume":"7","author":"M. Segal","year":"2009","unstructured":"Segal, M., Shpungin, H.: On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks\u00a07, 363\u2013373 (2009)","journal-title":"Ad Hoc Networks"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1080810.1080826","volume-title":"Proceedings of the 2005 joint workshop on Foundations of mobile computing","author":"H. Shpungin","year":"2005","unstructured":"Shpungin, H., Segal, M.: k-fault resistance in wireless ad-hoc networks. In: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pp. 89\u201396. ACM, New York (2005)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.adhoc.2007.06.006","volume":"6","author":"D. Yuan","year":"2008","unstructured":"Yuan, D., Bauer, J., Haugland, D.: Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms. Ad Hoc Networks\u00a06, 696\u2013717 (2008)","journal-title":"Ad Hoc Networks"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Ad Hoc Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11723-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T14:45:25Z","timestamp":1685371525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11723-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117220","9783642117237"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11723-7_26","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2010]]}}}