{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:15:18Z","timestamp":1769912118648,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175138","type":"print"},{"value":"9783642175145","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_26","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"303-314","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Traveling Tournament Problem with Maximum Tour Length 2"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Thielen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","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 - 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.\u00a02239, pp. 580\u2013584. Springer, Heidelberg (2001)"},{"key":"26_CR2","unstructured":"Campbell, R.T., Chen, D.S.: A minimum distance basketball scheduling problem. In: [13], pp. 15\u201325"},{"key":"26_CR3","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.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 100\u2013109. Springer, Heidelberg (2003)"},{"issue":"2","key":"26_CR4","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 travelling tournament problem. Journal of Scheduling\u00a09(2), 177\u2013193 (2006)","journal-title":"Journal of Scheduling"},{"key":"26_CR5","unstructured":"Miyashiro, R., Matsui, T., Imahori, S.: An approximation algorithm for the traveling tournament problem. In: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT) (2008)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-10631-6_69","volume-title":"Algorithms and Computation","author":"D. Yamaguchi","year":"2009","unstructured":"Yamaguchi, D., Imahori, S., Miyashiro, R., Matsui, T.: An improved approximation algorithm for the traveling tournament problem. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 679\u2013688. Springer, Heidelberg (2009)"},{"key":"26_CR7","unstructured":"Westphal, S., Noparlik, K.: A 5.875-approximation for the traveling tournament problem. In: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT) (2010)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Thielen, C., Westphal, S.: Complexity of the Traveling Tournament Problem. Theoretical Computer Science (2010) (online first), doi:10.1016\/j.tcs.2010.10.001","DOI":"10.1016\/j.tcs.2010.10.001"},{"key":"26_CR9","unstructured":"Bhattacharyya, R.: A note on complexity of traveling tournament problem. Optimization Online (2009)"},{"issue":"1","key":"26_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., Urrutia, S.: Scheduling in sports: An annotated bibliography. Computers and Operations Research\u00a037(1), 1\u201319 (2010)","journal-title":"Computers and Operations Research"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R. Rasmussen","year":"2008","unstructured":"Rasmussen, R., Trick, M.: Round robin scheduling - a survey. European Journal of Operations Research\u00a0188, 617\u2013636 (2008)","journal-title":"European Journal of Operations Research"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"de Werra, D.: Scheduling in sports. In: [14], pp. 381\u2013395","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"26_CR13","series-title":"Studies in the Management Sciences","volume-title":"Management Science in Sports","year":"1976","unstructured":"Machol, R.E., Ladany, S.P., Morrison, D. (eds.): Management Science in Sports. Studies in the Management Sciences, vol.\u00a04. North-Holland Publishing Company, Amsterdam (1976)"},{"key":"26_CR14","series-title":"Annuals of Discrete Mathematics","volume-title":"Studies on Graphs and Discrete Programming","author":"P. Hansen","year":"1981","unstructured":"Hansen, P.: Studies on Graphs and Discrete Programming. Annuals of Discrete Mathematics, vol.\u00a011. North-Holland Publishing Company, Amsterdam (1981)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T16:22:26Z","timestamp":1548433346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}