{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T11:58:51Z","timestamp":1704196731402},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T00:00:00Z","timestamp":1274918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00453-010-9414-0","type":"journal-article","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T14:03:01Z","timestamp":1274882581000},"page":"298-319","source":"Crossref","is-referenced-by-count":3,"title":["Energy-Efficient Paths in Radio Networks"],"prefix":"10.1007","volume":"61","author":[{"given":"Rene","family":"Beier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Matijevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,27]]},"reference":[{"issue":"1","key":"9414_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/0216006","volume":"16","author":"F. Aurenhammer","year":"1987","unstructured":"Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16(1), 78\u201396 (1987)","journal-title":"SIAM J. Comput."},{"key":"9414_CR2","first-page":"517","volume-title":"Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, B.C., Canada, May 1992","author":"P.D. Agarwal","year":"1992","unstructured":"Agarwal, P.D., Matousek, J.: Ray shooting and parametric search. In: Alon, N. (ed.) Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, B.C., Canada, May 1992, pp. 517\u2013526. ACM, New York (1992)"},{"key":"9414_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. Theory Appl. 17, 135\u2013152 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"6","key":"9414_CR4","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"9414_CR5","doi-asserted-by":"crossref","unstructured":"Beier, R., Sanders, P., Sivadasan, N.: Energy optimal routing in radio networks using geometric data structures. In: Proc. of the 29th Int. Coll. on Automata, Languages, and Programming (2002)","DOI":"10.1007\/3-540-45465-9_32"},{"key":"9414_CR6","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"9414_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"9414_CR8","doi-asserted-by":"crossref","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields. In: Proc. 24th Ann. ACM Symp. on the Theory of Computation (1992)","DOI":"10.1145\/129712.129766"},{"key":"9414_CR9","unstructured":"Callahan, P.B., Kosaraju, S.R.: Algorithms for dynamic closest pair and n-body potential fields. In: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithm (1995)"},{"issue":"2","key":"9414_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9414_CR11","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1006\/jagm.2001.1189","volume":"41","author":"T. Chan","year":"2001","unstructured":"Chan, T., Efrat, A.: Fly cheaply: On the minimum fuel consumption problem. J. Algorithms 41(2), 330\u2013337 (2001)","journal-title":"J. Algorithms"},{"key":"9414_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in conexion with graphs. Numer. Mat. 1, 269\u2013271 (1959)","journal-title":"Numer. Mat."},{"key":"9414_CR13","doi-asserted-by":"crossref","unstructured":"Efrat, A., Har-Peled, S.: Fly cheaply: on the minimum fuel-consumption problemma. In: Proc. 14th ACM Symp. on Computational Geometry (1998)","DOI":"10.1145\/276884.276900"},{"key":"9414_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02574030","volume":"13","author":"D. Eppstein","year":"1995","unstructured":"Eppstein, D.: Dynamic euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom. 13, 111\u2013122 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9414_CR15","unstructured":"Ford, L.R.: Network Flow Theory. Report P-923, The Rand Corporation, Santa Monica, CA (1956)"},{"key":"9414_CR16","series-title":"LNCS","volume-title":"Proc. of 11th European Symposium on Algorithms (ESA)","author":"S. Funke","year":"2003","unstructured":"Funke, S., Matijevic, D., Sanders, P.: Approximating energy efficient paths in multi-hop networks. In: Proc. of 11th European Symposium on Algorithms (ESA). LNCS, vol. 2832. Springer, Berlin (2003)"},{"key":"9414_CR17","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proc. of 10th Symposium on Discrete Algorithms (SODA), pp. 769\u2013778 (2001)"},{"key":"9414_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica 5, 215\u2013241 (1990)","journal-title":"Algorithmica"},{"key":"9414_CR19","unstructured":"Patel, D.: Energy in ad-hoc networking for the picoradio. Master\u2019s thesis, UC Berkeley (2000)"},{"key":"9414_CR20","volume-title":"Wireless Communication","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communication. Prentice Hall, New York (1996)"},{"key":"9414_CR21","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: Proc. of 33rd Symposium on the Theory of Computation (2001)","DOI":"10.1145\/380752.380798"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9414-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9414-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9414-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T09:05:24Z","timestamp":1635411924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9414-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,27]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9414"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9414-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,27]]}}}