{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:32:59Z","timestamp":1772760779756,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030677305","type":"print"},{"value":"9783030677312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-67731-2_24","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"337-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Multiple Traveling Salesman Problem on Spiders"],"prefix":"10.1007","author":[{"given":"Pedro","family":"P\u00e9rez-Escalona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Rapaport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.046","volume":"434","author":"X Bao","year":"2012","unstructured":"Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor. Comput. Sci. 434, 1\u201310 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Amariah, B., Alice, P.: A framework for vehicle routing approximation schemes in trees. In: Workshop on Algorithms and Data Structures, pp. 112\u2013125. Springer (2019)","DOI":"10.1007\/978-3-030-24766-9_9"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"key":"24_CR4","unstructured":"Nicos, C.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh Pa Management Sciences Research Group (1976)"},{"key":"24_CR5","unstructured":"Greg, N.F., Matthew, S.H., Chul, E.K.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178\u2013193 (1978)"},{"key":"24_CR6","unstructured":"Michael, R.G., David, S.J.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(02)00474-X","volume":"86","author":"G Daya","year":"2003","unstructured":"Daya, G., Arvind, G., Ramesh, K.: A 5\/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86, 87\u201391 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"24_CR8","first-page":"61","volume":"35","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Optimal control of plotting and drilling machines: a case study. Zeitschrift f\u00fcr Oper. Res. 35(1), 61\u201384 (1991)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44676-1_18","volume-title":"Algorithms \u2014 ESA 2001","author":"Y Karuno","year":"2001","unstructured":"Karuno, Y., Nagamochi, H.: A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 218\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_18"},{"issue":"2\u20133","key":"24_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.tcs.2003.09.010","volume":"312","author":"Y Karuno","year":"2004","unstructured":"Karuno, Y., Nagamochi, H.: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci. 312(2\u20133), 267\u2013280 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. Euro. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Euro. J. Oper. Res."},{"key":"24_CR12","unstructured":"Eugene, L.L.: The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics (1985)"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"H Donald Ratliff","year":"1983","unstructured":"Donald Ratliff, H., Arnon, S.R.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3), 507\u2013521 (1983)","journal-title":"Oper. Res."},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ejor.2012.12.023","volume":"227","author":"X Liang","year":"2013","unstructured":"Liang, X., Zhou, X., Dongsheng, X.: Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree. Euro. J. Oper. Res. 227(2), 284\u2013292 (2013)","journal-title":"Euro. J. Oper. Res."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-10631-6_40","volume-title":"Algorithms and Computation","author":"Z Xu","year":"2009","unstructured":"Xu, Z., Xu, L.: Approximation algorithms for min-max path cover problems with service handling time. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 383\u2013392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_40"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.orl.2008.10.006","volume":"37","author":"Y Wei","year":"2009","unstructured":"Wei, Y., Zhaohui, L.: Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37, 85\u201388 (2009)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T09:34:28Z","timestamp":1619256868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","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":"100","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":"33","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":"7","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":"33% - 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,1","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":"4,5","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}