{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:40Z","timestamp":1725542080440},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_69","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"679-688","source":"Crossref","is-referenced-by-count":6,"title":["An Improved Approximation Algorithm for the Traveling Tournament Problem"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Yamaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Miyashiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Report\u00a0388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"key":"69_CR2","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\u2013585. Springer, Heidelberg (2001)"},{"key":"69_CR3","unstructured":"Miyashiro, R., Matsui, T., Imahori, S.: An approximation algorithm for the traveling tournament problem. In: The 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Universit\u00e9 de Montr\u00e9al, CD-ROM (2008)"},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2005.10.063","volume":"177","author":"R.V. Rasmussen","year":"2007","unstructured":"Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research\u00a0177, 198\u2013213 (2007)","journal-title":"European Journal of Operational Research"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R.V. Rasmussen","year":"2008","unstructured":"Rasmussen, R.V., Trick, M.A.: Round robin scheduling \u2014 a survey. European Journal of Operational Research\u00a0188, 617\u2013636 (2008)","journal-title":"European Journal of Operational Research"},{"key":"69_CR6","unstructured":"Trick, M.: Challenge traveling tournament problems (2009), \n                  \n                    http:\/\/mat.gsia.cmu.edu\/TOURN\/"},{"key":"69_CR7","unstructured":"Yamaguchi, D., Imahori, S., Miyashiro, R., Matsui, T.: An improved approximation algorithm for the traveling tournament problem, Mathematical Engineering Technical Report, METR09-42, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo"}],"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-10631-6_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:58Z","timestamp":1619782618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}