{"id":"https://openalex.org/W1999372743","doi":"https://doi.org/10.1145/2591796.2591840","title":"Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing","display_name":"Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing","publication_year":2014,"publication_date":"2014-05-31","ids":{"openalex":"https://openalex.org/W1999372743","doi":"https://doi.org/10.1145/2591796.2591840","mag":"1999372743"},"language":"en","primary_location":{"id":"doi:10.1145/2591796.2591840","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020188279","display_name":"Zachary Friggstad","orcid":"https://orcid.org/0000-0003-4039-3235"},"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":"Zachary Friggstad","raw_affiliation_strings":["Univ. Alberta, Edmonton, AB","Univ. Alberta, Edmonton, AB#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Alberta, Edmonton, AB","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Univ. Alberta, Edmonton, AB#TAB#","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031968426","display_name":"Chaitanya Swamy","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Chaitanya Swamy","raw_affiliation_strings":["Univ. Waterloo, Waterloo, ON"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Waterloo, Waterloo, ON","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"744","last_page":"753"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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.996999979019165,"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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/regret","display_name":"Regret","score":0.8811067342758179},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.7901616096496582},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6144958734512329},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5787341594696045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5739808678627014},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5703752636909485},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5140115022659302},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49131861329078674},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47006306052207947},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4471592307090759},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4292244613170624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37697112560272217},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34290021657943726},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3260524272918701},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11327528953552246},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06841316819190979}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8811067342758179},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7901616096496582},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6144958734512329},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5787341594696045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5739808678627014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5703752636909485},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5140115022659302},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49131861329078674},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47006306052207947},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4471592307090759},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4292244613170624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37697112560272217},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34290021657943726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3260524272918701},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11327528953552246},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06841316819190979},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2591796.2591840","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3547378653","display_name":null,"funder_award_id":"327620-09","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1510484280","https://openalex.org/W1520680926","https://openalex.org/W1714443387","https://openalex.org/W1967197960","https://openalex.org/W1972755385","https://openalex.org/W1978593916","https://openalex.org/W1990177682","https://openalex.org/W1991223607","https://openalex.org/W2001139415","https://openalex.org/W2003281104","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2014369282","https://openalex.org/W2040678783","https://openalex.org/W2047085423","https://openalex.org/W2051369225","https://openalex.org/W2062361991","https://openalex.org/W2065185671","https://openalex.org/W2068840184","https://openalex.org/W2081444009","https://openalex.org/W2102201348","https://openalex.org/W2104334470","https://openalex.org/W2105088727","https://openalex.org/W2107550829","https://openalex.org/W2113939799","https://openalex.org/W2118639405","https://openalex.org/W2123068254","https://openalex.org/W2135201914","https://openalex.org/W2135932424","https://openalex.org/W2137716917","https://openalex.org/W2148026779","https://openalex.org/W2151239055","https://openalex.org/W2155735286","https://openalex.org/W2158591664","https://openalex.org/W2622090745","https://openalex.org/W2964162348","https://openalex.org/W3203962094"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"We":[0],"consider":[1,35],"vehicle-routing":[2],"problems":[3],"(VRPs)":[4],"that":[5,80,126,132],"incorporate":[6],"the":[7,19,31,37,46,105,118,129],"notion":[8],"of":[9,11,18,22,121],"regret":[10,86,145],"a":[12,16,23,71,82,85,90,97],"client,":[13],"which":[14],"is":[15,115,153,169],"measure":[17],"waiting":[20],"time":[21],"client":[24],"relative":[25],"to":[26,109,116,151,167],"its":[27,143,161],"shortest-path":[28],"distance":[29,106],"from":[30,107],"depot.":[32],"Formally,":[33],"we":[34,44,55],"both":[36],"additive":[38,144],"and":[39,84,96],"multiplicative":[40,162],"versions":[41],"of,":[42],"what":[43],"call,":[45],"regret-bounded":[47],"vehicle":[48],"routing":[49],"problem":[50],"(RVRP).":[51],"In":[52],"these":[53],"problems,":[54],"are":[56],"given":[57],"an":[58],"undirected":[59],"complete":[60],"graph":[61],"G":[62],"=":[63],"({r}":[64],"\u222a":[65],"V,E)":[66],"on":[67],"n":[68],"nodes":[69,130],"with":[70,149,165],"distinguished":[72],"root":[73],"(depot)":[74],"node":[75,98,135],"r,":[76],"edge":[77],"costs":[78],"{cuv}":[79],"form":[81],"metric,":[83],"bound":[87],"R.":[88],"Given":[89],"path":[91,140],"P":[92,152,168],"rooted":[93,123],"at":[94,124,154,170],"r":[95,108,125],"v":[99,110,136],"\u2208":[100],"P,":[101],"let":[102],"cP(v)":[103,146],"be":[104],"along":[111],"P.":[112],"The":[113],"goal":[114],"find":[117],"fewest":[119],"number":[120],"paths":[122],"cover":[127],"all":[128],"so":[131],"for":[133],"every":[134],"covered":[137],"by":[138],"(say)":[139],"P:":[141],"(i)":[142],"--":[147],"crv,":[148],"respect":[150,166],"most":[155,171],"R":[156,172],"in":[157,173],"additive-RVRP;":[158],"or":[159],"(ii)":[160],"regret,":[163],"cP(v)/crv,":[164],"multiplicative-RVRP.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}