{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:19:58Z","timestamp":1743092398673,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030795269"},{"type":"electronic","value":"9783030795276"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79527-6_10","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"167-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3169-4300","authenticated-orcid":false,"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6976-5579","authenticated-orcid":false,"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8848-7006","authenticated-orcid":false,"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1009-5552","authenticated-orcid":false,"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirko","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.04.018","volume":"810","author":"A B\u00e4rtschi","year":"2020","unstructured":"B\u00e4rtschi, A., et al.: Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810, 2\u201314 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2017.04.018","journal-title":"Theor. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Chalopin, J., Das, S., Disser, Y., Graf, D., Hackfeld, J., Penna, P.: Energy-efficient delivery by heterogeneous mobile agents. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, 8\u201311 March 2017. LIPIcs, vol. 66, pp. 10:1\u201310:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.10","DOI":"10.4230\/LIPIcs.STACS.2017.10"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Graf, D., Mihal\u00e1k, M.: Collective fast delivery by energy-efficient agents. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, 27\u201331 August 2018. LIPIcs, vol. 117, pp. 56:1\u201356:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.56","DOI":"10.4230\/LIPIcs.MFCS.2018.56"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Graf, D., Penna, P.: Truthful mechanisms for delivery with agents. In: D\u2019Angelo, G., Dollevoet, T. (eds.) 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2017, Vienna, Austria, 7\u20138 September 2017. OASICS, vol. 59, pp. 2:1\u20132:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2017.2","DOI":"10.4230\/OASIcs.ATMOS.2017.2"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-662-55751-8_8","volume-title":"Fundamentals of Computation Theory","author":"A B\u00e4rtschi","year":"2017","unstructured":"B\u00e4rtschi, A., Tschager, T.: Energy-efficient fast delivery by mobile agents. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 82\u201395. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55751-8_8"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-22935-0_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P Berman","year":"2011","unstructured":"Berman, P., Demaine, E.D., Zadimoghaddam, M.: O(1)-Approximations for maximum movement problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2011. LNCS, vol. 6845, pp. 62\u201374. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_6"},{"key":"10_CR7","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\u2019\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_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2016.09.007","volume":"652","author":"D Bil\u00f2","year":"2016","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. 652, 86\u2013101 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.09.007","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-25027-0_12","volume-title":"Fundamentals of Computation Theory","author":"IA Carvalho","year":"2019","unstructured":"Carvalho, I.A., Erlebach, T., Papadopoulos, K.: An efficient algorithm for the fast delivery problem. In: G\u0105sieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 171\u2013184. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_12"},{"key":"10_CR10","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\u2019\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_CR11","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, Part II. LNCS, vol. 8573, pp. 423\u2013434. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_36"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 114\u2013123. Association for Computing Machinery, New York (1998). https:\/\/doi.org\/10.1145\/276698.276719","DOI":"10.1145\/276698.276719"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., et al.: Minimizing movement. ACM Trans. Algorithms 5(3), 30:1\u201330:30 (2009). https:\/\/doi.org\/10.1145\/1541885.1541891","DOI":"10.1145\/1541885.1541891"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-20807-2_19","volume-title":"Integer Programming and Combinatoral Optimization","author":"IL G\u00f8rtz","year":"2011","unstructured":"G\u00f8rtz, I.L., Molinaro, M., Nagarajan, V., Ravi, R.: Capacitated Vehicle Routing with Non-uniform Speeds. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 235\u2013247. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_19"},{"issue":"6","key":"10_CR15","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","volume":"35","author":"WA Malik","year":"2007","unstructured":"Malik, W.A., Rathinam, S., Darbha, S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Oper. Res. Lett. 35(6), 747\u2013753 (2007). https:\/\/doi.org\/10.1016\/j.orl.2007.02.001","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1287\/ijoc.2015.0650","volume":"27","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for the multiple TSP with a fixed number of depots. Informs J. Comput. 27(4), 636\u2013645 (2015). https:\/\/doi.org\/10.1287\/ijoc.2015.0650","journal-title":"Informs J. Comput."},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11590-010-0256-0","volume":"6","author":"S Yadlapalli","year":"2012","unstructured":"Yadlapalli, S., Rathinam, S., Darbha, S.: 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim. Lett. 6(1), 141\u2013152 (2012). https:\/\/doi.org\/10.1007\/s11590-010-0256-0","journal-title":"Optim. Lett."}],"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-79527-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:04:13Z","timestamp":1624100653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","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":"48","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":"20","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":"0","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":"42% - 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)"}}]}}