{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:39:44Z","timestamp":1707557984576},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s10898-006-9017-0","type":"journal-article","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T07:59:24Z","timestamp":1151308764000},"page":"391-399","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication"],"prefix":"10.1007","volume":"36","author":[{"given":"Ionut","family":"Cardei","sequence":"first","affiliation":[]},{"given":"Mihaela","family":"Cardei","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baogang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"9017_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D. Chen","year":"2000","unstructured":"Chen D., Du D.-Z., Hu X., Lin G., Wang L., Xue G. (2000) Approximations for Steiner trees with minimum number of Steiner points. J. Global Optim. 18, 17\u201333","journal-title":"J. Global Optim."},{"key":"9017_CR2","doi-asserted-by":"crossref","unstructured":"Chang, J.-H., Tassiulas, L. Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. Lecture Notes in Computer Science, 1815\u00a0pp. 702\u2013713 Springer (2000)","DOI":"10.1007\/3-540-45551-5_59"},{"key":"9017_CR3","unstructured":"Chang, J.-H., Tassiulas, L. Energy conserving routing in wireless ad-hoc networks. Proceedings of the 19th Annual IEEE Infocom Conference (2000)"},{"key":"9017_CR4","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/43.62776","volume":"19","author":"C. Chiang","year":"1990","unstructured":"Chiang C., Sarrafzadeh M., Wong C.K. (1990) A powerful global router: based on Steiner min-max tree. IEEE Trans. Comput.-Aided Desig 19, 1318\u20131325","journal-title":"IEEE Trans. Comput.-Aided Desig"},{"key":"9017_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G. Lin","year":"1999","unstructured":"Lin G., Xue G. (1999) Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform. Process. Lett. 69:53\u201357","journal-title":"Inform. Process. Lett."},{"key":"9017_CR6","doi-asserted-by":"crossref","unstructured":"Li Q., Aslam J., Rus D. Online power-aware routing in wireless ad-hoc networks. Proceedings of ACM SIGMOBILE, pp. 97\u2013107 (2001)","DOI":"10.1145\/381677.381687"},{"key":"9017_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H.J. Pr\u00f6mel","year":"2000","unstructured":"Pr\u00f6mel H.J., Steger A. (2000) A new approximation algorithm for the steiner tree problem with performance ratio 5\/3. J. Algor. 36, 89\u2013101","journal-title":"J. Algor."},{"key":"9017_CR8","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/12.127452","volume":"41","author":"M. Sarrafzadeh","year":"1992","unstructured":"Sarrafzadeh M., Wong C.K. (1992) Bottleneck Steiner trees in the plane. IEEE Trans. Comput. 41:370\u2013374","journal-title":"IEEE Trans. Comput."},{"key":"9017_CR9","doi-asserted-by":"crossref","unstructured":"Slijepcevic, S., Potkonjak, M. Power efficient organization of wireless sensor networks. IEEE International Conference on Communications (ICC), June 2001, Helsinki, Finland","DOI":"10.1109\/ICC.2001.936985"},{"key":"9017_CR10","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s00453-001-0089-4","volume":"32","author":"L. Wang","year":"2002","unstructured":"Wang L., Du D.-Z. (2002) Approximations for a Bottleneck Steiner Tree Problem. Algorithmica 32:554\u2013561","journal-title":"Algorithmica"},{"key":"9017_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0020-0190(01)00209-5","volume":"81","author":"L. Wang","year":"2002","unstructured":"Wang L., Li Z. (2002) An approximation algorithm for a Bottleneck Steiner Tree Problem in the Euclidean plane. Inform. Process. Lett. 81:151\u2013156","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9017-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9017-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9017-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:05Z","timestamp":1559290325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9017-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["9017"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9017-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,27]]}}}