{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:18:11Z","timestamp":1777407491156,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,13]],"date-time":"2011-10-13T00:00:00Z","timestamp":1318464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s00453-011-9579-1","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T16:29:07Z","timestamp":1318436947000},"page":"1077-1091","source":"Crossref","is-referenced-by-count":13,"title":["An Improved Approximation Algorithm for the Traveling Tournament Problem"],"prefix":"10.1007","volume":"61","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","published-online":{"date-parts":[[2011,10,13]]},"reference":[{"key":"9579_CR1","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"key":"9579_CR2","first-page":"580","volume-title":"Lecture Notes in Computer Science","author":"K. Easton","year":"2001","unstructured":"Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem: description and benchmarks. In: Lecture Notes in Computer Science, vol.\u00a02239, pp.\u00a0580\u2013585. Springer, Berlin (2001)"},{"key":"9579_CR3","doi-asserted-by":"crossref","unstructured":"Miyashiro, R., Matsui, T., Imahori, S.: An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. (to appear). doi: 10.1007\/s10479-010-0742-x","DOI":"10.1007\/s10479-010-0742-x"},{"key":"9579_CR4","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 177, 198\u2013213 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9579_CR5","doi-asserted-by":"crossref","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\u2014a survey. Eur. J. Oper. Res. 188, 617\u2013636 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9579_CR6","unstructured":"Trick, M.: Challenge traveling tournament problems. Web page, as of 2010. http:\/\/mat.gsia.cmu.edu\/TOURN\/"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9579-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9579-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9579-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T11:03:22Z","timestamp":1560769402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9579-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,13]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9579"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9579-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,13]]}}}