{"id":"https://openalex.org/W7118445752","doi":"https://doi.org/10.48550/arxiv.2601.01841","title":"Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem","display_name":"Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem","publication_year":2026,"publication_date":"2026-01-05","ids":{"openalex":"https://openalex.org/W7118445752","doi":"https://doi.org/10.48550/arxiv.2601.01841"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.01841","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122062918","display_name":"Jingyang Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Jingyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122025897","display_name":"Yonghang Su","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Su, Yonghang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033729619","display_name":"Mingyu Xiao","orcid":"https://orcid.org/0000-0002-1012-2373"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao, Mingyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9495999813079834,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9495999813079834,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.032499998807907104,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.8260999917984009},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6089000105857849},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6061999797821045},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5198000073432922},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5116999745368958},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4383000135421753},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.34290000796318054}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8260999917984009},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6061999797821045},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5676000118255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5325999855995178},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5198000073432922},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5116999745368958},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36559998989105225},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3181000053882599},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.2939999997615814},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.25380000472068787},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,17],"Multiple-Depot":[1],"Split":[2],"Delivery":[3],"Vehicle":[4],"Routing":[5],"Problem":[6],"(MD-SDVRP)":[7],"is":[8,19],"a":[9,25,68,72,102,118],"challenging":[10],"problem":[11],"with":[12],"broad":[13],"applications":[14],"in":[15,31],"logistics.":[16],"goal":[18],"to":[20,128],"serve":[21],"customers'":[22],"demand":[23,37],"using":[24],"fleet":[26],"of":[27,52,75,121,135],"capacitated":[28],"vehicles":[29],"located":[30],"multiple":[32],"depots,":[33,122,136],"where":[34],"each":[35],"customer's":[36],"can":[38],"be":[39,86],"served":[40],"by":[41,100],"more":[42],"than":[43],"one":[44],"vehicle,":[45],"while":[46],"minimizing":[47],"the":[48,63,129,133],"total":[49],"travel":[50],"cost":[51],"all":[53],"vehicles.":[54],"We":[55],"study":[56],"approximation":[57,113,125,141],"algorithms":[58,114,126],"for":[59,71,106],"this":[60,83,95,107],"problem.":[61],"Previously,":[62],"only":[64],"known":[65],"result":[66],"was":[67,88],"$6$-approximation":[69],"algorithm":[70,105],"constant":[73,119],"number":[74,120,134],"depots":[76],"(INFORMS":[77],"J.":[78],"Comput.":[79],"2023),":[80],"and":[81,132],"whether":[82],"ratio":[84],"could":[85],"improved":[87,123],"left":[89],"as":[90,137,139],"an":[91],"open":[92],"question.":[93],"In":[94],"paper,":[96],"we":[97,110],"resolve":[98],"it":[99],"proposing":[101],"$(6-2\\cdot":[103],"10^{-36})$-approximation":[104],"setting.":[108],"Moreover,":[109],"develop":[111],"constant-factor":[112],"that":[115],"work":[116],"beyond":[117],"parameterized":[124],"related":[127],"vehicle":[130],"capacity":[131],"well":[138],"bi-factor":[140],"algorithms.":[142]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-08T00:00:00"}