{"id":"https://openalex.org/W7137929501","doi":"https://doi.org/10.1609/aaai.v40i43.40977","title":"A TSP-Based Algorithm for Multi-League Traveling Tournament","display_name":"A TSP-Based Algorithm for Multi-League Traveling Tournament","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137929501","doi":"https://doi.org/10.1609/aaai.v40i43.40977"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i43.40977","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.40977","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/40977/44938","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/40977/44938","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129739349","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/A5129745609","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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129728217","display_name":"Ken-Ichi Kawarabayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-Ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics\nThe University of Tokyo, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics\nThe University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":3,"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.09285714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"43","first_page":"36547","last_page":"36555"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9315999746322632,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9315999746322632,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.01489999983459711,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.014000000432133675,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9527999758720398},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6923999786376953},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6496000289916992},{"id":"https://openalex.org/keywords/multipartite","display_name":"Multipartite","score":0.4611000120639801},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.37689998745918274}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9527999758720398},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6923999786376953},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6496000289916992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.476500004529953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46720001101493835},{"id":"https://openalex.org/C166733315","wikidata":"https://www.wikidata.org/wiki/Q6934831","display_name":"Multipartite","level":4,"score":0.4611000120639801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45019999146461487},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4239000082015991},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.37689998745918274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.30250000953674316},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.257999986410141},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i43.40977","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.40977","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/40977/44938","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/40977","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/40977","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.40977","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i43.40977","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/40977/44938","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/G2084699896","display_name":"Graph Algorithms and Optimization: Theory and Scalable Algorithms","funder_award_id":"22H05001","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"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"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7137929501.pdf","grobid_xml":"https://content.openalex.org/works/W7137929501.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,61],"some":[1],"professional":[2],"sports":[3],"leagues,":[4,32],"inter-league":[5],"games":[6,37],"are":[7,28],"scheduled":[8],"among":[9],"multiple":[10],"divisions":[11],"or":[12,54],"conferences.":[13],"This":[14],"inspired":[15],"us":[16],"to":[17,86],"study":[18],"the":[19,45,51,67,87,95,112],"p-partite":[20,68],"Traveling":[21,88],"Tournament":[22],"Problem":[23],"(p-partite":[24],"TTP),":[25],"where":[26],"teams":[27,39],"partitioned":[29],"into":[30],"p":[31],"and":[33,59,76],"each":[34],"team":[35],"plays":[36],"against":[38],"from":[40],"different":[41],"leagues.":[42],"Previously,":[43],"only":[44],"case":[46],"of":[47,102],"p=2,":[48],"known":[49],"as":[50],"Bipartite":[52],"TTP":[53,69],"BTTP,":[55],"has":[56],"been":[57],"introduced":[58],"studied.":[60],"this":[62],"paper,":[63],"we":[64,77,92],"show":[65],"that":[66,94,111],"is":[70],"NP-hard":[71],"for":[72],"any":[73],"fixed":[74],"p\u22653,":[75],"propose":[78],"an":[79],"efficient":[80],"algorithm":[81,96,113],"based":[82],"on":[83],"a":[84,98],"solution":[85],"Salesman":[89],"Problem.":[90],"Furthermore,":[91],"prove":[93],"achieves":[97],"notable":[99],"approximation":[100],"ratio":[101],"8/3+O(1/n)":[103],"when":[104],"p=3.":[105],"We":[106],"also":[107],"conduct":[108],"experiments":[109],"demonstrating":[110],"produces":[114],"practical":[115],"schedules":[116],"with":[117],"significantly":[118],"reduced":[119],"total":[120],"travel":[121],"distances,":[122],"highlighting":[123],"its":[124],"effectiveness":[125],"in":[126],"generating":[127],"high-quality":[128],"multipartite":[129],"tournament":[130],"schedules.":[131]},"counts_by_year":[],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2026-03-18T00:00:00"}