{"id":"https://openalex.org/W330417094","doi":"https://doi.org/10.4086/toc.2007.v003a010","title":"","display_name":"","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W330417094","doi":"https://doi.org/10.4086/toc.2007.v003a010","mag":"330417094"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2007.v003a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2007.v003a010","pdf_url":"https://theoryofcomputing.org/articles/v003a010/v003a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v003a010/v003a010.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064235715","display_name":"Martin P\u00e1l","orcid":"https://orcid.org/0000-0002-1563-5426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Pal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6295,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.96366218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"1","first_page":"197","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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.9983999729156494,"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.9800999760627747,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9778000116348267,"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/combinatorics","display_name":"Combinatorics","score":0.8699646592140198},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8086321353912354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6954489350318909},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5111010670661926},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.506107747554779},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.47752419114112854},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4451606273651123},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4020862281322479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39969539642333984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11187011003494263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11080658435821533}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8699646592140198},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8086321353912354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6954489350318909},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5111010670661926},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.506107747554779},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.47752419114112854},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4451606273651123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4020862281322479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39969539642333984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11187011003494263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11080658435821533},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2007.v003a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2007.v003a010","pdf_url":"https://theoryofcomputing.org/articles/v003a010/v003a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2007.v003a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2007.v003a010","pdf_url":"https://theoryofcomputing.org/articles/v003a010/v003a010.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W330417094.pdf","grobid_xml":"https://content.openalex.org/works/W330417094.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1556959123","https://openalex.org/W1596429033","https://openalex.org/W1601649239","https://openalex.org/W1877952604","https://openalex.org/W1976231547","https://openalex.org/W2035610952","https://openalex.org/W2043916130","https://openalex.org/W2106299112","https://openalex.org/W2137717103","https://openalex.org/W2151239055","https://openalex.org/W2158591664","https://openalex.org/W2162750432","https://openalex.org/W2167197687","https://openalex.org/W2324108981","https://openalex.org/W2338905098","https://openalex.org/W3105140593","https://openalex.org/W4285719527","https://openalex.org/W4294358747"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W4241541331","https://openalex.org/W2259723333","https://openalex.org/W1002323541","https://openalex.org/W2038858023","https://openalex.org/W2886112286","https://openalex.org/W39612167","https://openalex.org/W2004512957"],"abstract_inverted_index":{"We":[0,72],"consider":[1],"a":[2,11,27,126,148,159,164],"variant":[3],"of":[4,29,36,59,64,137,146,161],"the":[5,42,49,53,70,78,91,112,144],"traveling":[6,80,95],"salesman":[7,81,96],"problem":[8,54,76,83,98,145],"(TSP):":[9],"Given":[10],"directed":[12],"graph":[13],"G":[14],"=":[15,87],"(V,":[16],"A)":[17],"with":[18],"non-negative":[19],"arc":[20],"lengths":[21],":":[22],"A":[23],"R":[24],"+":[25],"and":[26],"pair":[28],"vertices":[30,43,162],"s,t,":[31],"find":[32],"an":[33,61,101,134],"s-t":[34,62],"walk":[35],"minimum":[37,65,149],"length":[38,66,150],"that":[39,58,67,132,154],"visits":[40,68],"all":[41,69],"in":[44,163],"V":[45],".":[46],"If":[47],"satisfies":[48],"asymmetric":[50,79,94],"triangle":[51],"inequality,":[52],"is":[55,90,118,155],"equivalent":[56],"to":[57,74,143,157],"finding":[60,147],"path":[63,82,151],"vertices.":[71],"refer":[73],"this":[75,89,122],"as":[77],"(ATSPP).":[84],"When":[85],"s":[86],"t":[88],"well":[92],"known":[93,109,114],"tour":[97],"(ATSP).":[99],"Although":[100],"O(log":[102,138],"n)":[103],"approximation":[104,135],"ratio":[105,115,136],"has":[106,133],"long":[107],"been":[108],"for":[110,116,130],"ATSP,":[111],"best":[113],"ATSPP":[117,131],"O(":[119],"n).":[120,139],"In":[121],"paper":[123],"we":[124],"present":[125],"polynomial":[127],"time":[128],"algorithm":[129,141],"The":[140],"generalizes":[142],"or":[152],"cycle":[153],"required":[156],"visit":[158],"subset":[160],"given":[165],"order.":[166]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}