{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:21:05Z","timestamp":1648974065540},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T00:00:00Z","timestamp":1130112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s11036-005-4455-3","type":"journal-article","created":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T11:11:34Z","timestamp":1131621094000},"page":"997-1004","source":"Crossref","is-referenced-by-count":0,"title":["Max-Life Power Schedule for Connectivity and Biconnectivity in Wireless Ad Hoc Networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Wei","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,24]]},"reference":[{"key":"4455_CR1","doi-asserted-by":"crossref","unstructured":"D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, Aug. (2002).","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"4455_CR2","doi-asserted-by":"crossref","unstructured":"G. Calinescu, S. Kapoor, A. Olshevsky and A. Zelikovsky, Network lifetime and power assignment in ad-hoc wireless networks, in: Proc. of European Symposium on Algorithms, LNCS 2832, Sept. (2003) pp. 114\u2013126.","DOI":"10.1007\/978-3-540-39658-1_13"},{"key":"4455_CR3","doi-asserted-by":"crossref","unstructured":"G. Calinescu, I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science, Montreal, Aug. (2002).","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"4455_CR4","doi-asserted-by":"crossref","unstructured":"G. Calinescu and P.-J. Wan, Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc Networks, ACM Mobile Networks and Applications, Springer (to appear).","DOI":"10.1007\/s11036-006-4466-8"},{"key":"4455_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21 (1996) 433\u2013450.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"4455_CR6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Journal of ACM 41(2) (1994) 214\u2013235.","journal-title":"Journal of ACM"},{"key":"4455_CR7","doi-asserted-by":"crossref","unstructured":"E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (Lausanne, Switzerland) June (2002).","DOI":"10.1145\/513800.513816"},{"key":"4455_CR8","doi-asserted-by":"crossref","unstructured":"N. Garg and J. K\u00f6nemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (Palo Alto, CA) Nov. (1998) pp. 300\u2013309.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"4455_CR9","doi-asserted-by":"crossref","unstructured":"T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).","DOI":"10.1007\/978-1-4615-5491-2"},{"key":"4455_CR10","unstructured":"D.B. West, Introduction to Graph Theory, 2nd edition (Prentice-Hall, 2001)."}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-005-4455-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-005-4455-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-005-4455-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T19:43:30Z","timestamp":1586547810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-005-4455-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,24]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4455"],"URL":"https:\/\/doi.org\/10.1007\/s11036-005-4455-3","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,24]]}}}