{"id":"https://openalex.org/W2028148936","doi":"https://doi.org/10.1137/s0097539795295468","title":"Approximating Capacitated Routing and Delivery Problems","display_name":"Approximating Capacitated Routing and Delivery Problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2028148936","doi":"https://doi.org/10.1137/s0097539795295468","mag":"2028148936"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795295468","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795295468","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5065160332","display_name":"Prasad Chalasani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prasad Chalasani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4387,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.9695969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"28","issue":"6","first_page":"2133","last_page":"2149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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.9991000294685364,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.749481201171875},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5148200392723083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5091130137443542},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.43815967440605164},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4309820830821991},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.42838728427886963},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.41983866691589355},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.417763888835907},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40828782320022583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.370922327041626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37045958638191223},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3588847815990448},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.313954621553421},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23135924339294434}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.749481201171875},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5148200392723083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5091130137443542},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.43815967440605164},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4309820830821991},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.42838728427886963},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.41983866691589355},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.417763888835907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40828782320022583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.370922327041626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37045958638191223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3588847815990448},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.313954621553421},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23135924339294434},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539795295468","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795295468","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.4362","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.4362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~rajeev/postscripts/grasp2.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W436551700","https://openalex.org/W1546822455","https://openalex.org/W1966793805","https://openalex.org/W1975085296","https://openalex.org/W1991798215","https://openalex.org/W1992490235","https://openalex.org/W2018994930","https://openalex.org/W2022179164","https://openalex.org/W2024666707","https://openalex.org/W2032389500","https://openalex.org/W2034977257","https://openalex.org/W2043250424","https://openalex.org/W2044718761","https://openalex.org/W2053050060","https://openalex.org/W2053535761","https://openalex.org/W2054611719","https://openalex.org/W2056425817","https://openalex.org/W2063292248","https://openalex.org/W2063838679","https://openalex.org/W2085799273","https://openalex.org/W2088812877","https://openalex.org/W2089031378","https://openalex.org/W2107612355","https://openalex.org/W2125690626","https://openalex.org/W2129450453","https://openalex.org/W2139638032","https://openalex.org/W2143987816","https://openalex.org/W2150463089","https://openalex.org/W2162750432","https://openalex.org/W2172285784","https://openalex.org/W2258857078","https://openalex.org/W2617045890","https://openalex.org/W2949867427","https://openalex.org/W2956015669"],"related_works":["https://openalex.org/W2312815018","https://openalex.org/W4307315895","https://openalex.org/W43978825","https://openalex.org/W2770271386","https://openalex.org/W2164954524","https://openalex.org/W2982126233","https://openalex.org/W2005735141","https://openalex.org/W2030977429","https://openalex.org/W2790034418","https://openalex.org/W1871536084"],"abstract_inverted_index":{"We":[0,129,141,210],"provide":[1],"approximation":[2,70,258],"algorithms":[3],"for":[4,72,91,122,135,202,221,259],"some":[5,113],"capacitated":[6],"vehicle":[7,51],"routing":[8],"and":[9,29,59,83,112,158,184,248],"delivery":[10],"problems.":[11],"These":[12],"problems":[13,76,154,222],"can":[14],"all":[15],"be":[16,204],"viewed":[17],"as":[18],"instances":[19],"of":[20,52,75,81,146,149,223,262],"the":[21,78,92,136,144,164,181,188,195,230,234,245,250],"following":[22],"k-delivery":[23,123,150],"TSP:":[24],"given":[25],"n":[26,30,177],"source":[27],"points":[28,32],"sink":[31],"in":[33,155,180,194,244],"a":[34,45,50,105,120,132,167,206,256],"metric":[35],"space,":[36],"with":[37,125,197],"exactly":[38,61],"one":[39,62],"item":[40,63],"at":[41],"each":[42,65],"source,":[43],"find":[44],"minimum":[46],"length":[47],"tour":[48],"by":[49],"finite":[53,127,171],"capacity":[54],"k":[55],"to":[56,64,103,187,218,229],"pick":[57],"up":[58],"deliver":[60,185],"sink.":[66],"The":[67,190],"only":[68],"known":[69],"algorithm":[71,80,111,134],"this":[73,97,110,224],"family":[74],"is":[77,242],"2.5-approximation":[79],"Anily":[82],"Hassin":[84],"[":[85],"Networks,":[86],"22":[87],"(1992),":[88],"pp.":[89],"419--433]":[90],"special":[93],"case":[94,137],"k=1.":[95],"For":[96],"case,":[98],"we":[99,118,162,236],"use":[100],"matroid":[101],"intersection":[102],"obtain":[104],"2-approximation":[106,133],"algorithm.":[107],"Based":[108],"on":[109,205],"additional":[114],"lower":[115],"bound":[116],"arguments,":[117],"devise":[119],"factor-approximation":[121],"TSP":[124,151,241],"arbitrary":[126],"k.":[128],"also":[130],"present":[131],"$k":[138],"=":[139],"\\infty$.":[140],"then":[142],"initiate":[143],"study":[145],"dynamic":[147,246],"variants":[148],"that":[152,216,226,238,249],"model":[153],"industrial":[156],"robotics":[157,231],"other":[159],"applications.":[160],"Specifically,":[161],"consider":[163],"situation":[165],"where":[166],"robot":[168],"arm":[169],"(with":[170],"or":[172],"infinite":[173],"capacity)":[174],"must":[175],"collect":[176],"point-objects":[178,191],"moving":[179,193,207],"Euclidean":[182],"plane,":[183],"them":[186],"origin.":[189],"are":[192,227],"plane":[196],"known,":[198],"identical":[199],"velocities---they":[200],"might,":[201],"instance,":[203],"conveyor":[208],"belt.":[209],"derive":[211],"several":[212,260],"useful":[213],"structural":[214],"properties":[215],"lead":[217],"constant-factor":[219],"approximations":[220],"type":[225],"relevant":[228],"application.":[232],"Along":[233],"way,":[235],"show":[237],"maximum":[239],"latency":[240],"implicit":[243],"problems,":[247],"natural":[251],"\"farthest":[252],"neighbor\"":[253],"heuristic":[254],"produces":[255],"good":[257],"notions":[261],"latency.":[263]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}