{"id":"https://openalex.org/W1993194903","doi":"https://doi.org/10.1145/2582112.2582136","title":"A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs","display_name":"A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W1993194903","doi":"https://doi.org/10.1145/2582112.2582136","mag":"1993194903"},"language":"en","primary_location":{"id":"doi:10.1145/2582112.2582136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","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/A5042187195","display_name":"Jeff Erickson","orcid":"https://orcid.org/0000-0002-5253-2282"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff Erickson","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013188587","display_name":"Anastasios Sidiropoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anastasios Sidiropoulos","raw_affiliation_strings":["Department of Computer Science & Engineering and Department of Mathematics, The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering and Department of Mathematics, The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]}],"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":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"130","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9754999876022339,"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.9754999876022339,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9672999978065491,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9663000106811523,"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.7077411413192749},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6671633124351501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6423860192298889},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5529963970184326},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5246058702468872},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5142616629600525},{"id":"https://openalex.org/keywords/genus","display_name":"Genus","score":0.4877046048641205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4530014395713806},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.44755980372428894},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.43960005044937134},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.43714430928230286},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.42069441080093384},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.41598063707351685},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3679201006889343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34623125195503235},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3049905598163605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15883108973503113},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12005966901779175}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7077411413192749},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6671633124351501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6423860192298889},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5529963970184326},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5246058702468872},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5142616629600525},{"id":"https://openalex.org/C157369684","wikidata":"https://www.wikidata.org/wiki/Q34740","display_name":"Genus","level":2,"score":0.4877046048641205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4530014395713806},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.44755980372428894},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.43960005044937134},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.43714430928230286},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.42069441080093384},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41598063707351685},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3679201006889343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34623125195503235},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3049905598163605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15883108973503113},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12005966901779175},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2582112.2582136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1976151323","https://openalex.org/W1977006915","https://openalex.org/W1982687611","https://openalex.org/W2009803313","https://openalex.org/W2020547005","https://openalex.org/W2035610952","https://openalex.org/W2075645139","https://openalex.org/W2081444009","https://openalex.org/W2097289283","https://openalex.org/W2130025413","https://openalex.org/W2137717103","https://openalex.org/W2167197687","https://openalex.org/W2988480584","https://openalex.org/W4230627818","https://openalex.org/W4319589071"],"related_works":["https://openalex.org/W4287117052","https://openalex.org/W3176308333","https://openalex.org/W603403972","https://openalex.org/W2157783000","https://openalex.org/W2061237693","https://openalex.org/W1554245510","https://openalex.org/W1578113210","https://openalex.org/W2239518402","https://openalex.org/W4285762950","https://openalex.org/W2564891670"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,36,139,155],"near-optimal":[3],"polynomial-time":[4],"approximation":[5,27,43],"algorithm":[6,23,40,58,74,93,120,157],"for":[7,13,59,75,148,158],"the":[8,54,83,106,115,145],"asymmetric":[9],"traveling":[10],"salesman":[11],"problem":[12],"graphs":[14,34,48,61,86,99,132,161],"of":[15,29,45,85,105,121,144,162],"bounded":[16],"orientable":[17,134],"or":[18],"non-orientable":[19],"genus.":[20],"Given":[21],"any":[22],"that":[24,88],"achieves":[25,41],"an":[26,42,70],"ratio":[28],"f(n)":[30],"on":[31,47,81,160],"arbitrary":[32],"n-vertex":[33],"as":[35,142],"black":[37],"box,":[38],"our":[39,89,152],"factor":[44],"O(f(g))":[46],"with":[49,133,165],"genus":[50,84,135,163],"g.":[51],"In":[52],"particular,":[53],"O(log":[55,71,90],"n/loglog":[56],"n)-approximation":[57],"general":[60],"by":[62],"Asadpour":[63],"et":[64],"al.":[65],"[SODA":[66,126],"2010]":[67],"immediately":[68],"implies":[69],"g/loglog":[72,91],"g)-approximation":[73,92,119],"genus-g":[76,103,140],"graphs.":[77,150],"Moreover,":[78],"recent":[79],"results":[80],"approximating":[82],"imply":[87],"can":[94],"be":[95],"applied":[96],"to":[97,131],"bounded-degree":[98,149],"even":[100,147],"if":[101],"no":[102],"embedding":[104,141],"graph":[107],"is":[108],"given.":[109],"Our":[110],"result":[111],"improves":[112],"and":[113,124,137],"generalizes":[114],"o(\u221a":[116],"g":[117,136,164],"log":[118],"Oveis":[122],"Gharan":[123],"Saberi":[125],"2011],":[127],"which":[128],"applies":[129],"only":[130],"requires":[138],"part":[143],"input,":[146],"Finally,":[151],"techniques":[153],"yield":[154],"O(1)-approximation":[156],"ATSP":[159],"running":[166],"time":[167],"2O(g)":[168],"\u00b7":[169],"nO(1).":[170]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}