{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:19:24Z","timestamp":1768922364561,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"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_19","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"251-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved Approximations for\u00a0Capacitated Vehicle Routing with\u00a0Unsplittable Client Demands"],"prefix":"10.1007","author":[{"given":"Zachary","family":"Friggstad","sequence":"first","affiliation":[]},{"given":"Ramin","family":"Mousavi","sequence":"additional","affiliation":[]},{"given":"Mirmahdi","family":"Rahgoshay","sequence":"additional","affiliation":[]},{"given":"Mohammad\u00a0R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1007\/978-3-642-10631-6_100","volume-title":"Algorithms and Computation","author":"A Adamaszek","year":"2009","unstructured":"Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane for moderately large values of\u00a0k. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 994\u20131003. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_100"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6(4), 149\u2013158 (1987). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0167637787900125","DOI":"10.1016\/0167-6377(87)90012-5"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: Towards a polynomial time approximation scheme for general k. In: 29th ACM Symposium on the Theory of Computing (STOC), pp. 275\u2013283 (1997)","DOI":"10.1145\/258533.258602"},{"key":"19_CR5","unstructured":"Becker, A.: A tight 4\/3 approximation for capacitated vehicle routing in trees. In: 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 3:1\u20133:15 (2018)"},{"key":"19_CR6","unstructured":"Becker, A., Klein, P.N., Saulpic, D.: A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs. In: 25th Annual European Symposium on Algorithms (ESA), pp. 12:1\u201312:15 (2017)"},{"key":"19_CR7","unstructured":"Becker, A., Klein, P.N., Saulpic, D.: Polynomial-time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension. In: 26th Annual European Symposium on Algorithms (ESA), pp. 8:1\u20138:15 (2018)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Becker, A., Klein, P.N., Schild, A.: A PTAS for bounded-capacity vehicle routing in planar graphs. In: 16th International Algorithms and Data Structures Symposium (WADS), pp. 99\u2013111 (2019)","DOI":"10.1007\/978-3-030-24766-9_8"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-24766-9_9","volume-title":"Algorithms and Data Structures","author":"A Becker","year":"2019","unstructured":"Becker, A., Paul, A.: A framework for vehicle routing approximation schemes in trees. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 112\u2013125. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_9"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-73879-2_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Blauth","year":"2021","unstructured":"Blauth, J., Traub, V., Vygen, J.: Improving the approximation ratio for capacitated vehicle routing. In: Singh, M., Williamson, D.P. (eds.) IPCO 2021. LNCS, vol. 12707, pp. 1\u201314. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_1"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Filtser, A., Klein, P.N., Le, H.: On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs. In: 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 589\u2013600 (2020)","DOI":"10.1109\/FOCS46700.2020.00061"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-014-9906-4","volume":"73","author":"A Das","year":"2015","unstructured":"Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for euclidean capacitated vehicle routing. Algorithmica 73(1), 115\u2013142 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9906-4","journal-title":"Algorithmica"},{"key":"19_CR14","unstructured":"Friggstad, Z., Mousavi, R., Rahgoshay, M., Salavatipour, M.R.: Improved approximations for cvrp with unsplittable demands (2021). arXiv preprint arXiv:2111.08138"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementation of edmonds\u2019 algorithm for maximum matching on graphs. J. ACM (JACM) 23(2), 221\u2013234 (1976)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Kan, A.H.G.R.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-49381-6_42","volume-title":"Algorithms and Computation","author":"S Hamaguchi","year":"1998","unstructured":"Hamaguchi, S., Katoh, N.: A capacitated vehicle routing problem on a tree. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 399\u2013407. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49381-6_42"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Jayaprakash, A., Salavatipour, M.R.: Approximation schemes for capacitated vehicle routing on graphs of bounded treewidth, bounded doubling, or highway dimension. In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms SODA (2022)","DOI":"10.1137\/1.9781611977073.37"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-44914-2_16","volume-title":"Discrete Optimization and Operations Research","author":"M Khachay","year":"2016","unstructured":"Khachay, M., Dubinin, R.: PTAS for the euclidean capacitated vehicle routing problem in $$R^d$$. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 193\u2013205. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_16"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-53552-0_4","volume-title":"Learning and Intelligent Optimization","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Ogorodnikov, Y.: QPTAS for the CVRP with a moderate number of routes in a metric space of any fixed doubling dimension. In: Kotsireas, I.S., Pardalos, P.M. (eds.) LION 2020. LNCS, vol. 12096, pp. 27\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53552-0_4"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-49988-4_4","volume-title":"Mathematical Optimization Theory and Operations Research","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Ogorodnikov, Y., Khachay, D.: An extension of the das and mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension. In: Kononov, A., Khachay, M., Kalyagin, V.A., Pardalos, P. (eds.) MOTOR 2020. LNCS, vol. 12095, pp. 49\u201368. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49988-4_4"},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M Labb\u00e9","year":"1991","unstructured":"Labb\u00e9, M., Laporte, G., Mercure, H.: Capacitated vehicle routing on trees. Oper. Res. 39(4), 616\u2013622 (1991)","journal-title":"Oper. Res."},{"key":"19_CR24","unstructured":"Mathiue, C., Zhou, H.: A PTAS for Capacitated Vehicle Routing on Trees (2020). CoRR arXiv:2111.03735, https:\/\/arxiv.org\/abs\/2111.03735"},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1), 1\u201311 (1993)","journal-title":"Math. Oper. Res."}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T23:04:14Z","timestamp":1653951854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_19","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)"}}]}}