{"id":"https://openalex.org/W2062238337","doi":"https://doi.org/10.1137/100797357","title":"Asymmetric Traveling Salesman Path and Directed Latency Problems","display_name":"Asymmetric Traveling Salesman Path and Directed Latency Problems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2062238337","doi":"https://doi.org/10.1137/100797357","mag":"2062238337"},"language":"en","primary_location":{"id":"doi:10.1137/100797357","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100797357","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/A5020188279","display_name":"Zachary Friggstad","orcid":"https://orcid.org/0000-0003-4039-3235"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zachary Friggstad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025880780","display_name":"Zoya Svitkina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zoya Svitkina","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":1.3627,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84031313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":"4","first_page":"1596","last_page":"1619"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8080052137374878},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7821776866912842},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6796137094497681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6559483408927917},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5700877904891968},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5316774249076843},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5034303069114685},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.43287351727485657},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4313509464263916},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4243428111076355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3535047173500061},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2260436713695526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1805780529975891}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8080052137374878},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7821776866912842},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6796137094497681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6559483408927917},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5700877904891968},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5316774249076843},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5034303069114685},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.43287351727485657},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4313509464263916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4243428111076355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3535047173500061},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2260436713695526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1805780529975891},{"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.1137/100797357","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100797357","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":16,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W330417094","https://openalex.org/W1567063736","https://openalex.org/W1714357736","https://openalex.org/W1969925267","https://openalex.org/W1976231547","https://openalex.org/W2009279347","https://openalex.org/W2018994930","https://openalex.org/W2035610952","https://openalex.org/W2059222268","https://openalex.org/W2063836932","https://openalex.org/W2088342306","https://openalex.org/W2093376706","https://openalex.org/W2162750432","https://openalex.org/W2167197687","https://openalex.org/W2167374893"],"related_works":["https://openalex.org/W1594808828","https://openalex.org/W57550275","https://openalex.org/W1605331377","https://openalex.org/W4287281963","https://openalex.org/W1504003985","https://openalex.org/W1982624404","https://openalex.org/W2886112286","https://openalex.org/W2129220807","https://openalex.org/W2563091920","https://openalex.org/W1561999390"],"abstract_inverted_index":{"We":[0,317,372,427],"study":[1,105,377],"integrality":[2,268,341,416],"gaps":[3],"and":[4,27,158,169,179,237,247,300,363,382],"approximability":[5],"of":[6,30,62,77,80,86,123,136,140,186,223,254,270,292,310,331,343,348,378,418,431],"three":[7],"closely":[8],"related":[9],"problems":[10,32,142],"on":[11,132,229,266,435],"directed":[12,67,182,250,281,304,393],"graphs":[13],"with":[14],"edge":[15],"lengths":[16],"that":[17,103,128,197,326,413],"satisfy":[18],"the":[19,40,47,54,59,66,70,75,78,81,84,91,98,107,112,187,194,216,224,255,262,267,283,311,323,340,344,351,392,415,424],"triangle":[20],"inequality.":[21],"Given":[22],"two":[23,29],"specified":[24],"vertices":[25],"$s$":[26,94,120],"$t$,":[28,122],"these":[31,137,141],"ask":[33],"to":[34,57,73,95,115,121,200,387],"find":[35,116],"an":[36,328,356,388,409],"$s$-$t$":[37],"path":[38,51],"in":[39,110,181,184,221,249,252,308,360],"graph":[41],"visiting":[42],"all":[43],"other":[44],"vertices.":[45],"In":[46,65],"asymmetric":[48,217],"traveling":[49,176,218,244],"salesman":[50,219],"problem":[52,102,325,358],"(ATSPP),":[53],"objective":[55,71],"is":[56,72,90,106,114,131,277,408],"minimize":[58,74],"total":[60,125],"length":[61],"this":[63,379,436],"path.":[64,99],"latency":[68,85,306,394],"problem,":[69,395],"sum":[76],"latencies":[79],"vertices,":[82],"where":[83],"a":[87,290,319,375,396,419],"vertex":[88,130],"$v$":[89,96],"distance":[92],"from":[93,119],"along":[97],"The":[100,145],"third":[101],"we":[104],"$k$-person":[108,406],"ATSPP,":[109],"which":[111,385],"goal":[113],"$k$":[117],"paths":[118,180,248],"minimum":[124,305],"length,":[126],"such":[127],"every":[129],"at":[133],"least":[134],"one":[135],"paths.":[138],"All":[139],"are":[143,428],"NP-hard.":[144],"best":[146,263,284],"known":[147,264,286,401],"approximation":[148,173,241,287,329],"algorithms":[149],"for":[150,175,215,243,275,294,322,391,405],"ATSPP":[151,276,324,349,407],"had":[152],"ratio":[153,330],"$O(\\log":[154,201,210,332,389],"n)$":[155,204],"[C.":[156,361],"Chekuri":[157,362],"M.":[159,170,238,364],"Pal,":[160,365],"Theory":[161,366],"Comput.,":[162,367],"3":[163,368],"(2007),":[164,369],"pp.":[165,191,233,259,315,370],"197--209],":[166],"[U.":[167,235],"Feige":[168,236],"Singh,":[171,239],"\u201cImproved":[172,240],"ratios":[174,242],"salesperson":[177,245],"tours":[178,246],"graphs,\u201d":[183,251],"Proceedings":[185,222,253,309],"10th":[188,256],"APPROX,":[189,257,313],"2007,":[190,258],"107--118]":[192],"until":[193],"recent":[195],"result":[196,404],"improves":[198],"it":[199],"n/\\log":[202,211],"\\log":[203,212,411],"[A.":[205],"Asadpour":[206],"et":[207],"al.,":[208],"\u201cAn":[209],"n)$-approximation":[213,390,412],"algorithm":[214,288,321],"problem,\u201d":[220,307],"21st":[225],"Annual":[226],"ACM-SIAM":[227],"Symposium":[228],"Discrete":[230],"Algorithms,":[231],"2010,":[232],"379--389],":[234],"107--118].":[260],"However,":[261],"bound":[265],"gap":[269,342,417],"any":[271,295,432],"linear":[272,380,420],"programming":[273,421],"relaxation":[274,347,422],"only":[278],"$O(\\sqrt{n})$.":[279],"For":[280],"latency,":[282],"previously":[285,400],"has":[289,327],"guarantee":[291],"$O(n^{1/2+\\epsilon})$":[293],"constant":[296],"$\\epsilon>0$":[297],"[V.":[298],"Nagarajan":[299],"R.":[301],"Ravi,":[302],"\u201cThe":[303],"11th":[312],"2008,":[314],"193--206].":[316],"present":[318],"new":[320],"n)$,":[333],"but":[334],"whose":[335],"analysis":[336],"also":[337],"upper":[338],"bounds":[339,414],"standard":[345],"LP":[346],"by":[350,423],"same":[352,425],"factor.":[353,426],"This":[354],"solves":[355],"open":[357],"posed":[359],"197--209].":[371],"then":[373],"pursue":[374],"deeper":[376],"program":[381],"its":[383],"variations,":[384],"leads":[386],"significant":[397],"improvement":[398],"over":[399],"results.":[402],"Our":[403],"$O(k^2":[410],"not":[429],"aware":[430],"previous":[433],"work":[434],"problem.":[437]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}