{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:00:54Z","timestamp":1778270454777,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030895426","type":"print"},{"value":"9783030895433","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89543-3_12","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"137-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Further Improvement on\u00a0Approximating TTP-2"],"prefix":"10.1007","author":[{"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. J. Sched. 9(2), 177\u2013193 (2006)","journal-title":"J. Sched."},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.orl.2016.07.011","volume":"44","author":"R Bhattacharyya","year":"2016","unstructured":"Bhattacharyya, R.: Complexity of the unconstrained traveling tournament problem. Oper. Res. Lett. 44(5), 649\u2013654 (2016)","journal-title":"Oper. Res. Lett."},{"key":"12_CR3","first-page":"15","volume":"4","author":"RT Campbell","year":"1976","unstructured":"Campbell, R.T., Chen, D.: A minimum distance basketball scheduling problem. Manage. Sci. Sports 4, 15\u201326 (1976)","journal-title":"Manage. Sci. Sports"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10732-006-9007-x","volume":"13","author":"L Di Gaspero","year":"2007","unstructured":"Di Gaspero, L., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heurist. 13(2), 189\u2013207 (2007)","journal-title":"J. Heurist."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-45578-7_43","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"K Easton","year":"2001","unstructured":"Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580\u2013584. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_43"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45157-0_6","volume-title":"Practice and Theory of Automated Timetabling IV","author":"K Easton","year":"2003","unstructured":"Easton, K., Nemhauser, G., Trick, M.: Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Burke, E., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 100\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45157-0_6"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Goerigk, M., Hoshino, R., Kawarabayashi, K., Westphal, S.: Solving the traveling tournament problem by packing three-vertex paths. In: AAAI 2014, pp. 2271\u20132277 (2014)","DOI":"10.1609\/aaai.v28i1.9031"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/moor.2013.0597","volume":"38","author":"R Hoshino","year":"2013","unstructured":"Hoshino, R., Kawarabayashi, K.I.: An approximation algorithm for the bipartite traveling tournament problem. Math. Oper. Res. 38(4), 720\u2013728 (2013)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10479-012-1161-y","volume":"218","author":"S Imahori","year":"2012","unstructured":"Imahori, S., Matsui, T., Miyashiro, R.: A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218(1), 237\u2013247 (2012). https:\/\/doi.org\/10.1007\/s10479-012-1161-y","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall, G., Knust, S., Ribeiro, C.C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37(1), 1\u201319 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ejor.2005.02.065","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res. 174(3), 1459\u20131478 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10479-010-0742-x","volume":"194","author":"R Miyashiro","year":"2012","unstructured":"Miyashiro, R., Matsui, T., Imahori, S.: An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 194(1), 317\u2013324 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"RV Rasmussen","year":"2008","unstructured":"Rasmussen, R.V., Trick, M.A.: Round robin scheduling-a survey. Eur. J. Oper. Res. 188(3), 617\u2013636 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.tcs.2010.10.001","volume":"412","author":"C Thielen","year":"2011","unstructured":"Thielen, C., Westphal, S.: Complexity of the traveling tournament problem. Theoret. Comput. Sci. 412(4), 345\u2013351 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00186-012-0387-4","volume":"76","author":"C Thielen","year":"2012","unstructured":"Thielen, C., Westphal, S.: Approximation algorithms for TTP(2). Math. Methods Oper. Res. 76(1), 1\u201320 (2012)","journal-title":"Math. Methods Oper. Res."},{"key":"12_CR16","unstructured":"Trick, M.: Challenge traveling tournament instances (2013). http:\/\/mat.gsia.cmu.edu\/TOURN\/"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(88)90033-9","volume":"21","author":"D de Werra","year":"1988","unstructured":"de Werra, D.: Some models of graphs for scheduling sports competitions. Discret. Appl. Math. 21(1), 47\u201365 (1988)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10479-012-1061-1","volume":"218","author":"S Westphal","year":"2014","unstructured":"Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. Ann. Oper. Res. 218(1), 347\u2013360 (2014)","journal-title":"Ann. Oper. Res."},{"key":"12_CR19","unstructured":"Xiao, M., Kou, S.: An improved approximation algorithm for the traveling tournament problem with maximum trip length two. In: MFCS 2016, pp. 89:1\u201389:14 (2016)"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/s00453-011-9579-1","volume":"61","author":"D Yamaguchi","year":"2011","unstructured":"Yamaguchi, D., Imahori, S., Miyashiro, R., Matsui, T.: An improved approximation algorithm for the traveling tournament problem. Algorithmica 61(4), 1077\u20131091 (2011)","journal-title":"Algorithmica"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Zhao, J., Xiao, M.: A further improvement on approximating TTP-2. CoRR abs\/2108.13060 (2021)","DOI":"10.1007\/978-3-030-89543-3_12"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, J., Xiao, M.: The traveling tournament problem with maximum tour length two: a practical algorithm with an improved approximation bound. In: IJCAI 2021, pp. 4206\u20134212 (2021)","DOI":"10.24963\/ijcai.2021\/578"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:35:18Z","timestamp":1673577318000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}