{"id":"https://openalex.org/W7138942272","doi":"https://doi.org/10.1609/aaai.v40i43.41050","title":"FPT Approximation Algorithms for TSP on Non-Metric Graphs","display_name":"FPT Approximation Algorithms for TSP on Non-Metric Graphs","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138942272","doi":"https://doi.org/10.1609/aaai.v40i43.41050"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i43.41050","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41050","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41050/45011","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41050/45011","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129904842","display_name":"Jingyang Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jingyang Zhao","raw_affiliation_strings":["University of Electronic Science and Technology of China\nKyung Hee University, Yongin-si, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China\nKyung Hee University, Yongin-si, South Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074320024","display_name":"Zimo Sheng","orcid":null},"institutions":[{"id":"https://openalex.org/I143868143","display_name":"Anhui University","ror":"https://ror.org/05th6yx34","country_code":"CN","type":"education","lineage":["https://openalex.org/I143868143"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zimo Sheng","raw_affiliation_strings":["Anhui University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Anhui University","institution_ids":["https://openalex.org/I143868143"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mingyu Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingyu Xiao","raw_affiliation_strings":["University of Electronic Science and Technology of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52631579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"43","first_page":"37195","last_page":"37202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.45899999141693115,"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.45899999141693115,"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.2459000051021576,"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.09520000219345093,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7246000170707703},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.7038000226020813},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6312000155448914},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4650999903678894},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4602000117301941},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42989999055862427},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.42809998989105225}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7246000170707703},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.7038000226020813},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6312000155448914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6212999820709229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5837000012397766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4812000095844269},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4602000117301941},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.42809998989105225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3416000008583069},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.32010000944137573},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.3082999885082245},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.2809000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2791999876499176},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2578999996185303},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i43.41050","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41050","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41050/45011","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/41050","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/41050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i43.41050","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.41050","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/41050/45011","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3960697283","display_name":null,"funder_award_id":"62372095","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7138942272.pdf","grobid_xml":"https://content.openalex.org/works/W7138942272.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"TSP":[0,22],"is":[1,19],"a":[2,24,47,111,137],"classic":[3],"and":[4,15,56,75,100],"extensively":[5],"studied":[6,86],"problem":[7],"with":[8,123,136],"numerous":[9],"real-world":[10],"applications":[11],"in":[12,94,110,165],"artificial":[13],"intelligence":[14],"operations":[16],"research.":[17],"It":[18],"well-known":[20],"that":[21],"admits":[23],"constant":[25],"approximation":[26,78,121,153],"ratio":[27,144,154],"on":[28,41,53],"metric":[29,54,74,112],"graphs":[30,55,71],"but":[31],"becomes":[32],"NP-hard":[33],"to":[34,65,125,157],"approximate":[35],"within":[36],"any":[37],"computable":[38],"function":[39],"f(n)":[40],"general":[42,57,70],"graphs.":[43,58],"This":[44],"disparity":[45],"highlights":[46],"significant":[48],"gap":[49],"between":[50],"the":[51,67,90,97,102,142,152,160,163],"results":[52,109],"Recent":[59],"research":[60],"has":[61],"introduced":[62],"some":[63],"parameters":[64,87],"measure":[66],"``distance''":[68],"of":[69,92,105,145,162],"from":[72,155],"being":[73],"explored":[76],"FPT":[77,120,134],"algorithms":[79,122],"parameterized":[80],"by":[81],"these":[82,126],"parameters.":[83,128],"Two":[84],"commonly":[85],"are":[88],"p,":[89,130],"number":[91,104],"vertices":[93,106],"triangles":[95],"violating":[96],"triangle":[98],"inequality,":[99],"q,":[101,148],"minimum":[103],"whose":[107],"removal":[108],"graph.":[113],"In":[114],"this":[115],"paper,":[116],"we":[117,131,149],"present":[118],"improved":[119],"respect":[124],"two":[127],"For":[129,147],"propose":[132],"an":[133],"algorithm":[135],"1.5-approximation":[138],"ratio,":[139],"improving":[140],"upon":[141],"previous":[143],"2.5.":[146],"significantly":[150],"enhance":[151],"11":[156],"3,":[158],"advancing":[159],"state":[161],"art":[164],"both":[166],"cases.":[167]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-20T00:00:00"}