{"id":"https://openalex.org/W2143987816","doi":"https://doi.org/10.1137/0207017","title":"Approximation Algorithms for Some Routing Problems","display_name":"Approximation Algorithms for Some Routing Problems","publication_year":1978,"publication_date":"1978-05-01","ids":{"openalex":"https://openalex.org/W2143987816","doi":"https://doi.org/10.1137/0207017","mag":"2143987816"},"language":"en","primary_location":{"id":"doi:10.1137/0207017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207017","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/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086605863","display_name":"Matthew S. Hecht","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew S. Hecht","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031294259","display_name":"Chul E. Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chul E. Kim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9528,"has_fulltext":false,"cited_by_count":420,"citation_normalized_percentile":{"value":0.97033741,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"7","issue":"2","first_page":"178","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8633918166160583},{"id":"https://openalex.org/keywords/stacker","display_name":"Stacker","score":0.7667773365974426},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6432993412017822},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.580281674861908},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5512403845787048},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5483643412590027},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5323646068572998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5222031474113464},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5090970396995544},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5028910040855408},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.4549048840999603},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4547821581363678},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44384288787841797},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4305207133293152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42341238260269165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39526957273483276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38635075092315674}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8633918166160583},{"id":"https://openalex.org/C2777740907","wikidata":"https://www.wikidata.org/wiki/Q332280","display_name":"Stacker","level":2,"score":0.7667773365974426},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6432993412017822},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.580281674861908},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5512403845787048},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5483643412590027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5323646068572998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222031474113464},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5090970396995544},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5028910040855408},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4549048840999603},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4547821581363678},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44384288787841797},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4305207133293152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42341238260269165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39526957273483276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38635075092315674},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0207017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207017","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1992249619","https://openalex.org/W2007572995","https://openalex.org/W2026891055","https://openalex.org/W2040924621","https://openalex.org/W2049287714","https://openalex.org/W2064284095","https://openalex.org/W2086917808","https://openalex.org/W2089047615","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2371447506","https://openalex.org/W2386767533","https://openalex.org/W2057623054","https://openalex.org/W2369318675","https://openalex.org/W2593594440","https://openalex.org/W2994416637","https://openalex.org/W1484196235","https://openalex.org/W2365493740","https://openalex.org/W1889229872"],"abstract_inverted_index":{"Several":[0],"polynomial":[1],"time":[2],"approximation":[3],"algorithms":[4],"for":[5,40,54,70,93],"some":[6],"$NP$-complete":[7],"routing":[8],"problems":[9],"are":[10,28],"presented,":[11],"and":[12,66],"the":[13,17,20,41,58,62,67,91,94],"worst-case":[14],"ratios":[15],"of":[16,19,25,36,57,82],"cost":[18],"obtained":[21],"route":[22],"to":[23],"that":[24],"an":[26],"optimal":[27],"determined.":[29],"A":[30,49],"mixed-strategy":[31],"heuristic":[32,51,78],"with":[33],"a":[34,72,80],"bound":[35,81,92],"9/5":[37],"is":[38,52,75,90],"presented":[39],"stacker-crane":[42,68],"problem":[43],"(a":[44],"modified":[45],"traveling":[46,59],"salesman":[47,60],"problem).":[48],"tour-splitting":[50],"given":[53],"k-person":[55],"variants":[56],"problem,":[61,65,69],"Chinese":[63],"postman":[64],"which":[71],"minimax":[73],"solution":[74],"sought.":[76],"This":[77],"has":[79],"$e":[83],"+":[84],"1":[85],"-":[86],"1/k$,":[87],"where":[88],"e":[89],"corresponding":[95],"1-person":[96],"algorithm.":[97]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":26}],"updated_date":"2026-04-25T08:17:42.794288","created_date":"2025-10-10T00:00:00"}