{"id":"https://openalex.org/W3191437725","doi":"https://doi.org/10.24963/ijcai.2021/578","title":"The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound","display_name":"The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W3191437725","doi":"https://doi.org/10.24963/ijcai.2021/578","mag":"3191437725"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2021/578","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/578","pdf_url":"https://www.ijcai.org/proceedings/2021/0578.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2021/0578.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037988025","display_name":"Jingyang Zhao","orcid":"https://orcid.org/0000-0003-2322-750X"},"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":"Jingyang Zhao","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/A5033729619","display_name":"Mingyu Xiao","orcid":"https://orcid.org/0000-0002-1012-2373"},"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":true,"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":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033729619"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":0.5376,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.69203797,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"4206","last_page":"4212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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.9998999834060669,"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.9700999855995178,"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/T10731","display_name":"Educational Games and Gamification","score":0.9670000076293945,"subfield":{"id":"https://openalex.org/subfields/3204","display_name":"Developmental and Educational Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.975896418094635},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7993279695510864},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5779062509536743},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.4950849115848541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49434590339660645},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4634093940258026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4405602216720581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4214748740196228},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4126417934894562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40918460488319397},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3131536841392517}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.975896418094635},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7993279695510864},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5779062509536743},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.4950849115848541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49434590339660645},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4634093940258026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4405602216720581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4214748740196228},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4126417934894562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40918460488319397},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3131536841392517},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2021/578","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/578","pdf_url":"https://www.ijcai.org/proceedings/2021/0578.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2021/578","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/578","pdf_url":"https://www.ijcai.org/proceedings/2021/0578.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5887005072","display_name":"\u57fa\u4e8e\u6781\u503c\u56fe\u8bba\u548c\u8fd1\u4f3c\u6a21\u578b\u7684\u6838\u5fc3\u5316\u7b97\u6cd5\u7814\u7a76","funder_award_id":"61972070","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3191437725.pdf","grobid_xml":"https://content.openalex.org/works/W3191437725.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W96818046","https://openalex.org/W292355835","https://openalex.org/W1601564682","https://openalex.org/W1965391651","https://openalex.org/W1966852875","https://openalex.org/W1971938577","https://openalex.org/W1972849741","https://openalex.org/W1979001927","https://openalex.org/W1979381633","https://openalex.org/W2032550399","https://openalex.org/W2051443526","https://openalex.org/W2062742101","https://openalex.org/W2118240569","https://openalex.org/W2157841753","https://openalex.org/W2160642345","https://openalex.org/W2482644989","https://openalex.org/W2548392777","https://openalex.org/W3100949812"],"related_works":["https://openalex.org/W2909372716","https://openalex.org/W3029891807","https://openalex.org/W1572785861","https://openalex.org/W4352981148","https://openalex.org/W1571917368","https://openalex.org/W140783093","https://openalex.org/W2136437817","https://openalex.org/W2082888211","https://openalex.org/W2080638133","https://openalex.org/W2057901175"],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Tournament":[2],"Problem":[3],"is":[4,26,43],"a":[5,17,119],"well-known":[6,79],"benchmark":[7,80],"problem":[8,54,122],"in":[9,123],"tournament":[10,53],"timetabling,":[11],"which":[12],"asks":[13],"us":[14],"to":[15,112],"design":[16],"schedule":[18],"of":[19,22,38,101],"home/away":[20],"games":[21,61,64],"n":[23,41],"teams":[24,42],"(n":[25],"even)":[27],"under":[28],"some":[29],"feasibility":[30],"requirements":[31],"such":[32],"that":[33,83],"the":[34,40,51,78,106],"total":[35],"traveling":[36,52],"distance":[37],"all":[39,91],"minimized.":[44],"In":[45],"this":[46,124],"paper,":[47],"we":[48,84,104],"study":[49],"TTP-2,":[50],"where":[55],"at":[56],"most":[57],"two":[58],"consecutive":[59],"home":[60],"or":[62],"away":[63],"are":[65],"allowed,":[66],"and":[67],"give":[68],"an":[69,98],"effective":[70],"algorithm":[71],"for":[72,90,114],"n/2":[73,94,115],"being":[74,95,116],"odd.":[75],"Experiments":[76],"on":[77],"sets":[81],"show":[82],"can":[85],"beat":[86],"previously":[87],"known":[88],"solutions":[89],"instances":[92],"with":[93],"odd":[96],"by":[97],"average":[99],"improvement":[100],"2.66%.":[102],"Furthermore,":[103],"improve":[105],"theoretical":[107],"approximation":[108],"ratio":[109],"from":[110],"3/2+O(1/n)":[111],"1+O(1/n)":[113],"odd,":[117],"answering":[118],"challenging":[120],"open":[121],"area.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}