{"id":"https://openalex.org/W4318820632","doi":"https://doi.org/10.1145/3582500","title":"Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension","display_name":"Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension","publication_year":2023,"publication_date":"2023-02-01","ids":{"openalex":"https://openalex.org/W4318820632","doi":"https://doi.org/10.1145/3582500"},"language":"en","primary_location":{"id":"doi:10.1145/3582500","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3582500","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3582500","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3582500","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071255487","display_name":"Aditya Jayaprakash","orcid":"https://orcid.org/0000-0002-8396-6868"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Aditya Jayaprakash","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada"],"raw_orcid":"https://orcid.org/0000-0002-8396-6868","affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7650-2045","affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.7089,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.72106925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"19","issue":"2","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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.9979000091552734,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.9911999702453613,"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/mathematics","display_name":"Mathematics","score":0.6883053779602051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6742161512374878},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6131566762924194},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6124346256256104},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5816319584846497},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5348042249679565},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5045086145401001},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44304805994033813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38431647419929504},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3333665132522583},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2593141198158264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19536477327346802},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1125439703464508}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6883053779602051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6742161512374878},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6131566762924194},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6124346256256104},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5816319584846497},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5348042249679565},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5045086145401001},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44304805994033813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38431647419929504},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3333665132522583},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2593141198158264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19536477327346802},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1125439703464508},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3582500","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3582500","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3582500","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3582500","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3582500","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3582500","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4318820632.pdf","grobid_xml":"https://content.openalex.org/works/W4318820632.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1541012495","https://openalex.org/W2017372614","https://openalex.org/W2039011874","https://openalex.org/W2053578961","https://openalex.org/W2065154034","https://openalex.org/W2104166288","https://openalex.org/W2111563176","https://openalex.org/W2137208273","https://openalex.org/W2141819463","https://openalex.org/W2151148851","https://openalex.org/W2155735286","https://openalex.org/W2165142526","https://openalex.org/W2203654255","https://openalex.org/W2559541197","https://openalex.org/W2799100393","https://openalex.org/W2889438244","https://openalex.org/W2965002304","https://openalex.org/W2966058519","https://openalex.org/W2966539377","https://openalex.org/W3012882765","https://openalex.org/W3037510082","https://openalex.org/W3042970838","https://openalex.org/W3104752286","https://openalex.org/W3127920245","https://openalex.org/W3211737054","https://openalex.org/W4213477793","https://openalex.org/W4285190221"],"related_works":["https://openalex.org/W2018691209","https://openalex.org/W4312143452","https://openalex.org/W2949617446","https://openalex.org/W4294299870","https://openalex.org/W2748664888","https://openalex.org/W1582492864","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W35387897","https://openalex.org/W1934849835"],"abstract_inverted_index":{"In":[0,18,95,252],"this":[1,207,253,260],"article,":[2,254],"we":[3,30,255],"present":[4],"Approximation":[5,267],"Schemes":[6,268],"for":[7,65,147,163,176,179,206,228,240,270,294],"Capacitated":[8],"Vehicle":[9],"Routing":[10],"Problem":[11],"(CVRP)":[12],"on":[13,249,259],"several":[14],"classes":[15],"of":[16,49,63,112,125,182,210,244,272,276,282],"graphs.":[17,211],"CVRP,":[19],"introduced":[20],"by":[21,131,139,263],"Dantzig":[22],"and":[23,46,90,108,157,193,213,280],"Ramser":[24],"in":[25],"1959":[26],"[":[27,190,215],"14":[28],"],":[29],"are":[31],"given":[32],"a":[33,40,47,59,104],"graph":[34],"G=(V,E)":[35],"with":[36,222,298],"metric":[37],"edges":[38],"costs,":[39],"depot":[41],"r":[42],"\u2208":[43],"V":[44],",":[45,169],"vehicle":[48,67],"bounded":[50,273,277,283],"capacity":[51],"Q":[52,77,120,250],".":[53,121,233,307],"The":[54,143],"goal":[55],"is":[56,172,188,202,238],"to":[57,70],"find":[58],"minimum":[60],"cost":[61],"collection":[62],"tours":[64,141],"the":[66,71,84,96,109,123,155,161,173,180,184,295],"that":[68,80],"returns":[69],"depot,":[72],"each":[73,100,113,126],"visiting":[74],"at":[75],"most":[76],"nodes,":[78],"such":[79],"they":[81],"cover":[82],"all":[83],"nodes.":[85],"This":[86],"generalizes":[87],"classic":[88,261],"TSP":[89],"has":[91,103,150,195],"been":[92,196],"studied":[93],"extensively.":[94],"more":[97,118],"general":[98,148],"setting,":[99],"node":[101,127],"v":[102,107],"demand":[105,111,124],"d":[106],"total":[110],"tour":[114,133],"must":[115,128],"be":[116,129,137],"no":[117],"than":[119],"Either":[122],"served":[130,138],"one":[132],"(unsplittable)":[134],"or":[135],"can":[136],"multiple":[140],"(splittable).":[142],"best-known":[144],"approximation":[145,175,186,204,220,236,292],"algorithm":[146],"graphs":[149,271,275,281],"ratio":[151,187],"\u03b1":[152,158,171],"+2(1-\u03b5)":[153],"(for":[154,160],"unsplittable)":[156],"+1-\u03b5":[159],"splittable)":[162],"some":[164],"fixed":[165],"\\(ε":[166],"\\gt":[167],"\\frac{1}{3000}\\)":[168],"where":[170],"best":[174,185],"TSP.":[177],"Even":[178],"case":[181],"trees,":[183],"4/3":[189],"5":[191,305],"]":[192,217],"it":[194],"an":[197,203,219,291],"open":[198],"question":[199],"if":[200],"there":[201],"scheme":[205,221,237,293],"simple":[208],"class":[209,243],"Das":[212],"Mathieu":[214],"15":[216],"presented":[218],"time":[223,300],"n":[224,227,301],"log":[225],"O(1/\u03b5)":[226],"Euclidean":[229,296],"plane":[230,297],"\u211d":[231],"2":[232],"No":[234],"other":[235,242],"known":[239],"any":[241],"metrics":[245],"(without":[246],"further":[247],"restrictions":[248],").":[251],"make":[256],"significant":[257],"progress":[258],"problem":[262],"presenting":[264],"Quasi-Polynomial":[265],"Time":[266],"(QPTAS)":[269],"treewidth,":[274],"highway":[278],"dimensions,":[279],"doubling":[284],"dimensions.":[285],"For":[286],"comparison,":[287],"our":[288],"result":[289],"implies":[290],"run":[299],"O(log":[302],"6":[303],"n/\u03b5":[304],")":[306]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}