{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:51:20Z","timestamp":1742381480506},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_32","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"366-376","source":"Crossref","is-referenced-by-count":6,"title":["Energy Optimal Routing in Radio Networks Using Geometric Data Structures"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"Beier","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"P. D. Agarwal and J. Matousek. Ray shooting and parametric search. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 517\u2013526, Victoria, B.C., Canada, May 1992. ACM Press.","DOI":"10.1145\/129712.129763"},{"issue":"4","key":"32_CR2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. Bentley","year":"1980","unstructured":"J. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software, 6(4):563\u2013580, December 1980.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"T. Chan. Approximate nearest neighbor queries revisited. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), pages 352\u2013358, New York, June 4\u20136 1997. ACM Press.","DOI":"10.1145\/262839.263001"},{"issue":"2","key":"32_CR4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1006\/jagm.2001.1189","volume":"41","author":"T. Chan","year":"2001","unstructured":"T. Chan and A. Efrat. Fly cheaply: On the minimum fuel consumption problem. Journal of Algorithms, 41(2):330\u2013337, November 2001.","journal-title":"Journal of Algorithms"},{"key":"32_CR5","volume-title":"Computational Geometry Algorithms and Applications","author":"B. M de","year":"2000","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 2., rev. ed. edition, 2000.","edition":"2., rev. ed. ed"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"A. Efrat and S. Har-Peled. Fly cheaply: On the minimum fuel-consumption problem. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry (SCG\u201998), pages 143\u2013145, New York, June 1998. Association for Computing Machinery.","DOI":"10.1145\/276884.276900"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02574030","volume":"13","author":"D. Eppstein","year":"1995","unstructured":"D. Eppstein. Dynamic euclidean minimum spanning trees and extrema of binary functions. Disc. Comp. Geom., 13:111\u2013122, 1995.","journal-title":"Disc. Comp. Geom."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"J. M. Rabaey et al. Picoradio supports ad hoc ultra-low power wireless networking. IEEE Computer Magazine, pages 42\u201348, July 2000.","DOI":"10.1109\/2.869369"},{"issue":"6","key":"32_CR9","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/71.932709","volume":"12","author":"K. Nakano","year":"2001","unstructured":"K. Nakano, S. Olariu, and A. Y. Zomaya. Energy-efficient permutation routing in radio networks. IEEE Transactions on Parallel and Distributed Systems, 12(6):544\u2013557, 2001.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"32_CR10","unstructured":"D. Patel. Energy in ad-hoc networking for the picoradio. Master\u2019s thesis, UC Berkeley, 2000."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry. Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"32_CR12","unstructured":"T. S. Rappaport. Wireless Communication. Prentice Hall, 1996."},{"key":"32_CR13","unstructured":"K. R. Varadarajan and P. K. Agarwal. Approximation algorithms for bipartite and non-bipartite matching in the plane. In SODA, pages 805\u2013814, 1999."},{"key":"32_CR14","unstructured":"Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder. Minimum-energy broadcast routing in static ad hoc wireless networks. In IEEE Infocom, 2001."},{"key":"32_CR15","first-page":"585","volume":"2","author":"J. E. Wieselthier","year":"2000","unstructured":"J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In IEEE Infocom, volume 2, pages 585\u2013594. IEEE, 2000.","journal-title":"IEEE Infocom"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:05:58Z","timestamp":1556449558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}