{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:02:38Z","timestamp":1742932958793,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030249212"},{"type":"electronic","value":"9783030249229"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24922-9_10","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T10:04:49Z","timestamp":1562925889000},"page":"139-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Disser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00453-014-9939-8","volume":"74","author":"J Anaya","year":"2016","unstructured":"Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vax\u00e8s, Y.: Convergecast and broadcast by power-aware mobile agents. Algorithmica 74(1), 117\u2013155 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152(2), 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"10_CR3","unstructured":"Bampas, E., Chalopin, J., Das, S., Hackfeld, J., Karousatou, C.: Maximal exploration of trees with energy-constrained agents. CoRR, abs\/1802.06636 (2018)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-72751-6_1","volume-title":"Algorithms for Sensor Systems","author":"E Bampas","year":"2017","unstructured":"Bampas, E., Das, S., Dereniowski, D., Karousatou, C.: Collaborative delivery by energy-sharing low-power mobile robots. In: Fern\u00e1ndez Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 1\u201312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72751-6_1"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., et al.: Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. (2017)","DOI":"10.1007\/978-3-319-48314-6_17"},{"key":"10_CR6","unstructured":"B\u00e4rtschi, A., et al.: Energy-efficient delivery by heterogeneous mobile agents. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 10:1\u201310:14 (2017)"},{"key":"10_CR7","unstructured":"B\u00e4rtschi, A., Graf, D., Mihal\u00e1k, M.: Collective fast delivery by energy-efficient agents. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 117, pp. 56:1\u201356:16 (2018)"},{"key":"10_CR8","unstructured":"B\u00e4rtschi, A., Graf, D., Penna, P.: Truthful mechanisms for delivery with agents. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). OpenAccess Series in Informatics (OASIcs), vol. 59, pp. 2:1\u20132:17 (2017)"},{"issue":"2","key":"10_CR9","first-page":"231","volume":"18","author":"M Betke","year":"1995","unstructured":"Betke, M., Rivest, R.L., Singh, M.: Piecemeal learning of an unknown environment. Mach. Learn. 18(2), 231\u2013254 (1995)","journal-title":"Mach. Learn."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-45346-5_6","volume-title":"Algorithms for Sensor Systems","author":"D Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, D., Disser, Y., Gual\u00e0, L., Mihal\u00e1k, M., Proietti, G., Widmayer, P.: Polygon-constrained motion planning problems. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 67\u201382. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45346-5_6"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-45346-5_9","volume-title":"Algorithms for Sensor Systems","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Das, S., Mihal\u00e1k, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 111\u2013122. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45346-5_9"},{"key":"10_CR12","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). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_36"},{"key":"10_CR13","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). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_18"},{"key":"10_CR14","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). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_25"},{"key":"10_CR15","unstructured":"Das, S., Dereniowski, D., Uznanski, P.: Energy constrained depth first search. CoRR, abs\/1709.10146 (2017)"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541885.1541891","volume":"5","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. ACM Trans. Algorithms 5(3), 1\u201330 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ic.2014.12.005","volume":"243","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Disser, Y., Kosowski, A., Paj\u0105k, D., Uzna\u0144ski, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37\u201349 (2015)","journal-title":"Inf. Comput."},{"key":"10_CR18","unstructured":"Duncan, C.A., Kobourov, S.G., Anil Kumar, V.S.: Optimal constrained graph exploration. In: 12th ACM Symposium on Discrete Algorithms, SODA 2001, pp. 807\u2013814 (2001)"},{"key":"10_CR19","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). https:\/\/doi.org\/10.1007\/11682127_24"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72951-8_5","volume-title":"Structural Information and Communication Complexity","author":"M Dynia","year":"2007","unstructured":"Dynia, M., \u0141opusza\u0144ski, J., Schindelhauer, C.: Why robots need maps. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 41\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72951-8_5"},{"key":"10_CR21","doi-asserted-by":"publisher","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafael (2012)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ga\u0327sieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166\u2013177 (2006)","DOI":"10.1002\/net.20127"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"10_CR24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"10_CR25","unstructured":"Giannakos, A., Hifi, M., Karagiorgos, G.: Data delivery by mobile agents with energy constraints over a fixed path. CoRR, abs\/1703.05496 (2017)"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24922-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:58:27Z","timestamp":1710266307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24922-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030249212","9783030249229"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24922-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.gssi.it\/sirocco2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}