{"id":"https://openalex.org/W2024133435","doi":"https://doi.org/10.1142/s0129054114500051","title":"APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME","display_name":"APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2024133435","doi":"https://doi.org/10.1142/s0129054114500051","mag":"2024133435"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114500051","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114500051","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5062090877","display_name":"Alexander Golovnev","orcid":"https://orcid.org/0000-0002-7847-1027"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I150149174","display_name":"Mercer University","ror":"https://ror.org/04bk7v425","country_code":"US","type":"education","lineage":["https://openalex.org/I150149174"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ALEXANDER GOLOVNEV","raw_affiliation_strings":["Department of Computer Science, New York University, 251 Mercer St., New York, NY 10012, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University, 251 Mercer St., New York, NY 10012, USA","institution_ids":["https://openalex.org/I150149174","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062090877"],"corresponding_institution_ids":["https://openalex.org/I150149174","https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.09652778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"01","first_page":"89","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9983999729156494,"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.7259743213653564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.724442720413208},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6152752041816711},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5793341398239136},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.556756854057312},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5218542814254761},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.486451119184494},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4782813489437103},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45772987604141235},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44573262333869934},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44241252541542053},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4422059953212738},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4207683503627777},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.21824964880943298},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20257827639579773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11120957136154175}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7259743213653564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.724442720413208},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6152752041816711},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5793341398239136},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.556756854057312},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5218542814254761},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.486451119184494},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4782813489437103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45772987604141235},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44573262333869934},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44241252541542053},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4422059953212738},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4207683503627777},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.21824964880943298},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20257827639579773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11120957136154175},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114500051","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114500051","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W1506292197","https://openalex.org/W1542928981","https://openalex.org/W1574082713","https://openalex.org/W1589421353","https://openalex.org/W1599622173","https://openalex.org/W1796559407","https://openalex.org/W1824848400","https://openalex.org/W1965255372","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1975286948","https://openalex.org/W1988642505","https://openalex.org/W1994248285","https://openalex.org/W2001868457","https://openalex.org/W2008391796","https://openalex.org/W2009803313","https://openalex.org/W2011039300","https://openalex.org/W2012438638","https://openalex.org/W2012473793","https://openalex.org/W2022179164","https://openalex.org/W2026891055","https://openalex.org/W2035610952","https://openalex.org/W2038652993","https://openalex.org/W2043841752","https://openalex.org/W2048068744","https://openalex.org/W2051080010","https://openalex.org/W2056179869","https://openalex.org/W2057385022","https://openalex.org/W2058748455","https://openalex.org/W2079928809","https://openalex.org/W2081444009","https://openalex.org/W2086917808","https://openalex.org/W2110367141","https://openalex.org/W2136400551","https://openalex.org/W2137717103","https://openalex.org/W2141355868","https://openalex.org/W2151732151","https://openalex.org/W2167197687","https://openalex.org/W2168336253","https://openalex.org/W2171554063","https://openalex.org/W2394485070","https://openalex.org/W2962875727"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4389362338","https://openalex.org/W4299305030","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"Let":[0],"G":[1,29],"be":[2,31,123],"a":[3,44,66,102,139],"complete":[4],"directed":[5],"graph":[6],"with":[7,86,93,109],"n":[8,35,79,80,82,95,111,158,179],"vertices":[9],"and":[10,37,55,113,162,181],"integer":[11],"edge":[12],"weights":[13,88],"in":[14,28,33,156],"range":[15],"[0,M].":[16],"It":[17,100],"is":[18,57,90,101,118],"well":[19],"known":[20,61,73],"that":[21,120],"an":[22,91,107],"optimal":[23],"Traveling":[24],"Salesman":[25],"Problem":[26],"(TSP)":[27],"can":[30],"solved":[32],"2":[34,110,157,178],"time":[36,77,112,128,161],"space":[38,68,183],"(all":[39],"bounds":[40],"are":[41],"given":[42],"within":[43,125],"polynomial":[45,67,114,127,182],"factor":[46],"of":[47],"the":[48,59,71,175],"input":[49],"length,":[50],"i.e.,":[51],"poly(n,":[52,166],"log":[53,81,167],"M))":[54],"this":[56,134],"still":[58],"fastest":[60],"algorithm.":[62],"If":[63],"we":[64,137],"allow":[65],"only,":[69],"then":[70],"best":[72],"algorithm":[74,92,108,142,176],"has":[75],"running":[76,98],"4":[78],".":[83],"For":[84],"TSP":[85,121,155],"bounded":[87],"there":[89],"1.657":[94],"\u00b7":[96,165],"M":[97],"time.":[99],"big":[103],"challenge":[104],"to":[105,153,184],"develop":[106],"space.":[115,169],"Also,":[116],"it":[117],"well-known":[119],"cannot":[122],"approximated":[124],"any":[126,145,172],"computable":[129],"function":[130],"unless":[131],"P=NP.":[132],"In":[133],"short":[135],"note":[136],"propose":[138],"very":[140],"simple":[141],"that,":[143],"for":[144,171],"0":[146],"<":[147,149],"\u03b5":[148,159,163],"1,":[150],"finds":[151],"(1+\u03b5)-approximation":[152],"asymmetric":[154],"\u22121":[160,164],"M)":[168],"Thereby,":[170],"fixed":[173],"\u03b5,":[174],"needs":[177],"steps":[180],"compute":[185],"(1":[186],"+":[187],"\u03b5)-approximation.":[188]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}