{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:56Z","timestamp":1725861536624},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_19","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"235-246","source":"Crossref","is-referenced-by-count":0,"title":["Balls and Funnels: Energy Efficient Group-to-Group Anycasts"],"prefix":"10.1007","author":[{"given":"Jennifer","family":"Iglesias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"19_CR1","unstructured":"Aichholzer, O., Allen, S., Aloupis, G., Barba, L., Bose, P., de Varufel, J.L., Iacono, J., Langerman, S., Souvaine, D., Taslakian, P., Yagnatinsky, M.: Sum of squared edges for MST of a point set in a unit square. In: Japanese Conference on Discrete and Computational Geometry (JCDCG) (2013)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/1921659.1921664","volume":"7","author":"C Chekuri","year":"2011","unstructured":"Chekuri, C., Even, G., Gupta, A., Segev, D.: Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans. Algorithms 7(2), 18:1\u201318:17 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: ACM Theory of Computing, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"issue":"5","key":"19_CR5","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1137\/S0097539704445718","volume":"36","author":"E Halperin","year":"2007","unstructured":"Halperin, E., Kortsarz, G., Krauthgamer, R., Srinivasan, A., Wang, N.: Integrality ratio for group Steiner trees and directed Steiner trees. SIAM J. Comput. 36(5), 1494\u20131511 (2007)","journal-title":"SIAM J. Comput."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: ACM Theory of Computing, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"key":"19_CR7","unstructured":"Iglesias, J., Rajaraman, R., Ravi, R., Sundaram, R.: Balls and funnels: energy efficient group-to-group anycasts. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 558, pp. 235\u2013246. Springer, Heidelberg (2016). CoRR http:\/\/arxiv.org\/abs\/1605.07196"},{"key":"19_CR8","unstructured":"Lapowsky, I.: Facebook lays out its roadmap for creating internet-connected drones. Wired (2014). http:\/\/www.wired.com\/2014\/09\/facebook-drones-2\/"},{"issue":"18","key":"19_CR9","doi-asserted-by":"crossref","first-page":"3746","DOI":"10.1016\/j.comcom.2007.09.003","volume":"30","author":"D Li","year":"2007","unstructured":"Li, D., Liu, Q., Hu, X., Jia, X.: Energy efficient multicast routing in ad hoc wireless networks. Comput. Commun. 30(18), 3746\u20133756 (2007)","journal-title":"Comput. Commun."},{"key":"19_CR10","unstructured":"McNeal, G.: Google wants Internet broadcasting drones, plans to run tests in New Mexico. Forbes (2014). http:\/\/www.forbes.com\/sites\/gregorymcneal\/2014\/09\/19\/google-wants-internet-broadcasting-drones-plans-to-run-tests-in-new-mexico\/"},{"key":"19_CR11","unstructured":"Milyeykovski, V., Segal, M., Shpungin, H.: Location, location, location: using central nodes for efficient data collection in WSNs. In: WiOpt, pp. 333\u2013340, May 2013"},{"key":"19_CR12","unstructured":"Olsson, P.M.: Positioning algorithms for surveillance using unmanned aerial vehicles. Licentiate thesis, Link\u00f6pings universitet (2011)"},{"key":"19_CR13","unstructured":"Path Loss Wikipedia. http:\/\/en.wikipedia.org\/wiki\/Path_loss"},{"key":"19_CR14","volume-title":"Wireless Communications: Principles and Practice","author":"T Rappaport","year":"2001","unstructured":"Rappaport, T.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall PTR, Upper Saddle River (2001)","edition":"2"},{"key":"19_CR15","unstructured":"Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., Ravi, S.S.: Spanning trees short or small. In: ACM-SIAM Discrete Algorithms, SODA 1994, pp. 546\u2013555. SIAM (1994)"},{"issue":"6","key":"19_CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"PJ Wan","year":"2002","unstructured":"Wan, P.J., C\u0103linescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Netw. 8(6), 607\u2013617 (2002)","journal-title":"Wirel. Netw."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: INFOCOM, pp. 585\u2013594 (2000)","DOI":"10.1109\/INFCOM.2000.832232"},{"issue":"3","key":"19_CR18","first-page":"251","volume":"6","author":"JE Wieselthier","year":"2001","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for energy-efficient multicasting in static ad hoc wireless networks. MONET 6(3), 251\u2013263 (2001)","journal-title":"MONET"},{"key":"19_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:03:53Z","timestamp":1568185433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}