{"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","alternate_titles":[],"publication_year":2026,"publication_date":"2026-01-05","ids":{"openalex":"https://openalex.org/W7118445752","doi":"https://doi.org/10.48550/arxiv.2601.01841"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2601.01841","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.01841","pdf_url":"https://arxiv.org/pdf/2601.01841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7118445752"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2601.01841","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037988025","display_name":"Jingyang Zhao","orcid":"https://orcid.org/0000-0003-2322-750X","observed_orcids":["https://orcid.org/0000-0003-2322-750X"]},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]},{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["CN","KR"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Zhao, Jingyang","raw_affiliation_strings":["Kyung Hee University , Yongin-si , South Korea","University of Electronic Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyung Hee University , Yongin-si , South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122025897","display_name":"Yonghang Su","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Su, Yonghang","raw_affiliation_strings":["University of Electronic Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033729619","display_name":"Mingyu Xiao","orcid":"https://orcid.org/0000-0002-1012-2373","observed_orcids":["https://orcid.org/0000-0002-1012-2373"]},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Xiao, Mingyu","raw_affiliation_strings":["University of Electronic Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9779999852180481,"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.9779999852180481,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02070000022649765,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.00019999999494757503,"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-algorithms","display_name":"approximation algorithms","score":0.8999999761581421},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.8759999871253967},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.7689999938011169},{"id":"https://openalex.org/keywords/cycle-covers","display_name":"cycle covers","score":0.9020000100135803},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.7770000100135803},{"id":"https://openalex.org/keywords/vehicle-capacity-constraints","display_name":"vehicle capacity constraints","score":0.5680000185966492},{"id":"https://openalex.org/keywords/capacitated-vehicle-routing-problem","display_name":"capacitated vehicle routing problem","score":0.6330000162124634}],"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":2,"locations":[{"id":"pmh:oai:arXiv.org:2601.01841","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.01841","pdf_url":"https://arxiv.org/pdf/2601.01841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2601.01841","doi":"https://doi.org/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":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2601.01841","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.01841","pdf_url":"https://arxiv.org/pdf/2601.01841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5378999710083008}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7118445752.pdf","grobid_xml":"https://content.openalex.org/works/W7118445752.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1786863823","https://openalex.org/W1857333123","https://openalex.org/W1966209162","https://openalex.org/W1969481197","https://openalex.org/W1974848406","https://openalex.org/W1988345713","https://openalex.org/W2001139415","https://openalex.org/W2017372614","https://openalex.org/W2034097982","https://openalex.org/W2056897184","https://openalex.org/W2057532434","https://openalex.org/W2117226423","https://openalex.org/W2131338629","https://openalex.org/W2138871135","https://openalex.org/W2155735286","https://openalex.org/W2156036190","https://openalex.org/W2211743518","https://openalex.org/W2963049334","https://openalex.org/W2988480584","https://openalex.org/W3085644258","https://openalex.org/W3104752286","https://openalex.org/W3192199234","https://openalex.org/W4285190221","https://openalex.org/W4377200004","https://openalex.org/W4378220009","https://openalex.org/W4400357987","https://openalex.org/W4408247777","https://openalex.org/W4409280356","https://openalex.org/W4409664154","https://openalex.org/W7053560968"],"related_works":["https://openalex.org/W4378220009","https://openalex.org/W7117464169","https://openalex.org/W4306168826","https://openalex.org/W4389482143","https://openalex.org/W1508644659","https://openalex.org/W3192562241","https://openalex.org/W4409664154","https://openalex.org/W2756316790","https://openalex.org/W1529079830","https://openalex.org/W7213592852"],"abstract_inverted_index":{"The":[0,19,144],"multiple-depot":[1,154],"split":[2,43],"delivery":[3],"vehicle":[4,170,198],"routing":[5],"problem":[6,11,112],"is":[7,21],"a":[8,27,66,92,127,140,159,178,191],"challenging":[9],"optimization":[10],"with":[12],"broad":[13],"applications":[14],"in":[15,183,203,208],"logistics":[16],"and":[17,44,75,134,227],"transportation.":[18],"goal":[20],"to":[22,41,125,137],"serve":[23],"customers'":[24],"demand":[25,40],"using":[26],"limited":[28],"fleet":[29],"of":[30,59,118,169],"capacitated":[31],"vehicles":[32,138],"stationed":[33],"at":[34],"multiple":[35,47],"depots,":[36,60],"allowing":[37],"each":[38],"customer's":[39],"be":[42,80],"served":[45],"by":[46,56,90,122],"vehicles,":[48],"while":[49],"minimizing":[50],"the":[51,57,61,105,109,153,166,217],"total":[52],"travel":[53,204],"cost.":[54],"Parameterized":[55],"number":[58],"previous":[62],"best-known":[63,106],"result":[64],"was":[65],"slice-wise":[67],"polynomial-time":[68],"$6$-approximation":[69],"algorithm":[70,97,115,163,194],"(INFORMS":[71],"J.":[72],"Comput.":[73],"2023),":[74],"whether":[76],"this":[77,88],"ratio":[78,107],"could":[79],"improved":[81],"remained":[82],"an":[83,149],"open":[84],"question.":[85],"We":[86,156],"resolve":[87],"question":[89],"proposing":[91],"fixed-parameter":[93],"tractable":[94],"(FPT)":[95],"$(2\u03b1+1+\\varepsilon)$-approximation":[96],"for":[98,108,152,177],"any":[99],"constant":[100],"$\\varepsilon>0$,":[101],"where":[102],"$\u03b1<3/2$":[103],"denotes":[104],"traveling":[110],"salesman":[111],"(TSP).":[113],"Our":[114],"enumerates":[116],"partitions":[117],"connected":[119],"components":[120],"formed":[121],"low-cost":[123,128],"edges":[124],"construct":[126],"cycle":[129],"cover,":[130],"then":[131],"extracts":[132],"paths,":[133],"assigns":[135],"them":[136],"through":[139],"minimum-cost":[141],"flow":[142],"method.":[143],"cycle-cover":[145],"technique":[146],"also":[147],"yields":[148],"FPT":[150],"$(\u03b1+\\varepsilon)$-approximation":[151],"TSP.":[155],"further":[157],"propose":[158],"simple":[160],"parameterized":[161],"$5$-approximation":[162],"based":[164],"on":[165],"structural":[167],"properties":[168],"capacities,":[171],"which":[172],"achieves":[173],"polynomial":[174],"running":[175],"time":[176],"specific":[179],"setting":[180],"that":[181,195,216],"appears":[182],"existing":[184],"benchmark":[185],"instances.":[186],"In":[187],"addition,":[188],"we":[189],"develop":[190],"bi-factor":[192],"approximation":[193],"balances":[196],"minor":[197],"capacity":[199],"violations":[200],"against":[201],"reductions":[202],"cost":[205],"or":[206],"gains":[207],"computational":[209,213],"efficiency.":[210],"Finally,":[211],"our":[212],"experiments":[214],"demonstrate":[215],"proposed":[218],"methods":[219],"exhibit":[220],"complementary":[221],"strengths":[222],"across":[223],"various":[224],"instance":[225],"types":[226],"achieve":[228],"competitive":[229],"solution":[230],"quality.":[231]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7118445752","counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-01-08T00:00:00"}
