{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:58:16Z","timestamp":1777399096031,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069000","type":"print"},{"value":"9783031069017","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_15","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"195-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Combinatorial Algorithms for\u00a0Rooted Prize-Collecting Walks and Applications to\u00a0Orienteering and Minimum-Latency Problems"],"prefix":"10.1007","author":[{"given":"Sina","family":"Dezfuli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Friggstad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Post","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/S0036142993226983","volume":"8","author":"J Bang-Jensen","year":"1995","unstructured":"Bang-Jensen, J., Frank, A., Jackson, B.: Preserving and increasing local edge-connectivity in mixed graphs. SIAM J. Discret. Math. 8(2), 155\u2013178 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time windows. In: Proceedings of 36th STOC, pp. 166\u2013174 (2004)","DOI":"10.1145\/1007352.1007385"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of 26th STOC, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discount-reward TSP. SIAM J. Comput. 37, 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/moor.2015.0758","volume":"41","author":"D Chakrabarty","year":"2016","unstructured":"Chakrabarty, D., Swamy, C.: Facility location with client latencies: linear-programming based techniques for minimum-latency problems. Math. Oper. Res. 41(3), 865\u2013883 (2016)","journal-title":"Math. Oper. Res."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Godfrey, P.B., Rao, S., Talwar, K.: Paths, trees and minimum latency tours. In: Proceedings of 44th FOCS, pp. 36\u201345 (2003)","DOI":"10.1109\/SFCS.2003.1238179"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229167","volume":"8","author":"C Chekuri","year":"2012","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3), 1\u201327 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR8","unstructured":"Dezfuli, S.S.: Solving the LP relaxation of distance-constrained vehicle routing problem using column generation. Master\u2019s thesis, University of Alberta (2019)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Dezfuli, S.S., Friggstad, Z., Post, I., Swamy, C.: Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems. Manuscript posted on the CS arXiv, November 2021","DOI":"10.1007\/978-3-031-06901-7_15"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The $$k$$-traveling repairman problem. ACM Trans. Algorithms 3(4), Article 40 (2007)","DOI":"10.1145\/1290672.1290677"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar-Gonz\u00e1les, J.J., Toth, P.: Solving the orienteering problem through branch and cut. INFORMS J. Comput. 10, 133\u2013148 (1998)","journal-title":"INFORMS J. Comput."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Swamy, C.: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. In: Proceedings of 46th STOC, pp. 744\u2013753 (2014)","DOI":"10.1145\/2591796.2591840"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-59250-3_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"Z Friggstad","year":"2017","unstructured":"Friggstad, Z., Swamy, C.: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 199\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_17"},{"key":"15_CR14","unstructured":"Kobeaga, G., Merino, M., Lozano, J.A.: A revisited branch-and-cut algorithm for large-scale orienteering problems. CoRR: 2011.02743 (2021)"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"59","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209\u2013214 (2012)","journal-title":"Networks"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1287\/moor.2019.1002","volume":"45","author":"A Paul","year":"2019","unstructured":"Paul, A., Freund, D., Ferber, A., Shmoys, D.B., Williamson, D.B.: Budgeted prize-collecting traveling salesman and minimum spanning tree problems. Math. Oper. Res. 45(2), 576\u2013590 (2019)","journal-title":"Math. Oper. Res."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Post, I., Swamy, C.: Linear-programming based techniques for multi-vehicle minimum latency problems. In: Proceedings of 26th SODA, pp. 512\u2013531 (2015)","DOI":"10.1137\/1.9781611973730.35"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - a traveling salesman library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06901-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T23:20:59Z","timestamp":1727306459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"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":"35% - 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":"33","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)"}}]}}