{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:30Z","timestamp":1759637850743},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319727509"},{"type":"electronic","value":"9783319727516"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72751-6_8","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:03:05Z","timestamp":1514631785000},"page":"98-113","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Energy-Optimal Broadcast in a Tree with Mobile Agents"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Moussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-33651-5_4","volume-title":"Distributed Computing","author":"J Anaya","year":"2012","unstructured":"Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vax\u00e8s, Y.: Collecting information by power-aware mobile agents. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 46\u201360. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33651-5_4"},{"issue":"5","key":"8_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"issue":"4","key":"8_CR3","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1921659.1921663","volume":"7","author":"C Amb\u00fchl","year":"2011","unstructured":"Amb\u00fchl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(4), 1\u201321 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1137\/05063787X","volume":"37","author":"J Augustine","year":"2008","unstructured":"Augustine, J., Irani, S., Swamy, C.: Optimal powerdown strategies. SIAM J. Comput. 37, 1499\u20131516 (2008)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discret. Appl. Math. 68, 17\u201332 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"8_CR7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/77600.77618","volume":"37","author":"B Awerbuch","year":"1990","unstructured":"Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A trade-off between information and communication in broadcast protocols. J. ACM 37(2), 238\u2013256 (1990)","journal-title":"J. ACM"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y Azar","year":"1998","unstructured":"Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 178\u2013195. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0029569"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"RA Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R.A., Schott, R.: Parallel searching in the plane. Comput. Geom. 5, 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"issue":"1","key":"8_CR10","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-48314-6_17","volume-title":"Structural Information and Communication Complexity","author":"A B\u00e4rtschi","year":"2016","unstructured":"B\u00e4rtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A., Mihal\u00e1k, M.: Collaborative delivery with energy-constrained mobile robots. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 258\u2013274. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48314-6_17"},{"key":"8_CR12","unstructured":"B\u00e4rtschi, A., Chalopin, J., Das, S., Disser, Y., Graf, D., Hackfeld, J., Penna, P.: Energy-efficient delivery by heterogeneous mobile agents. In: Proceedings of STACS, pp. 10:1\u201310:14 (2017)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-43951-7_36","volume-title":"Automata, Languages, and Programming","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Jacob, R., Mihal\u00e1k, M., Widmayer, P.: Data delivery by energy-constrained mobile agents on a line. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 423\u2013434. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43951-7_36"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-48314-6_18","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2016","unstructured":"Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Communication problems for mobile agents exchanging energy. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 275\u2013288. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48314-6_18"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-25258-2_25","volume-title":"Structural Information and Communication Complexity","author":"S Das","year":"2015","unstructured":"Das, S., Dereniowski, D., Karousatou, C.: Collaborative exploration by energy-constrained mobile robots. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 357\u2013369. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-25258-2_25"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol. 3894, pp. 341\u2013351. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11682127_24"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24698-5_18","volume-title":"LATIN 2004: Theoretical Informatics","author":"P Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 141\u2013151. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24698-5_18"},{"issue":"4","key":"8_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1290672.1290678","volume":"3","author":"S Irani","year":"2007","unstructured":"Irani, S., Shukla, S.K., Gupta, R.: Algorithms for power savings. ACM Trans. Algorithms 3(4), 41 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle routing: problems, methods, and applications. SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of 36th FOCS, pp. 374\u2013382 (1995)","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72751-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:05:30Z","timestamp":1514631930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}