{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:56:25Z","timestamp":1710255385734},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9426-y","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T13:57:07Z","timestamp":1321451827000},"page":"1-9","source":"Crossref","is-referenced-by-count":10,"title":["The three-dimensional matching problem in Kalmanson matrices"],"prefix":"10.1007","volume":"26","author":[{"given":"Sergey","family":"Polyakovskiy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"9426_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","volume":"92","author":"HJ Bandelt","year":"1992","unstructured":"Bandelt HJ, Dress AWM (1992) A canonical decomposition theory for metrics of a finite set. Adv Math 92:47\u2013105","journal-title":"Adv Math"},{"key":"9426_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1004907919611","volume":"69","author":"V Chepoi","year":"1998","unstructured":"Chepoi V, Fichet B (1998) A\u00a0note on circular decomposable metrics. Geom Dedic 69:237\u2013240","journal-title":"Geom Dedic"},{"key":"9426_CR3","series-title":"LNCS","first-page":"486","volume-title":"Proceedings of the 4th annual European symposium on algorithms (ESA\u20191996)","author":"G Christopher","year":"1996","unstructured":"Christopher G, Farach M, Trick M (1996). The structure of circular decomposable metrics. In: Proceedings of the 4th annual European symposium on algorithms (ESA\u20191996). LNCS, vol\u00a01136. Springer, Berlin, pp 486\u2013500"},{"key":"9426_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y Crama","year":"1992","unstructured":"Crama Y, Spieksma FCR (1992) Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur J Oper Res 60:273\u2013279","journal-title":"Eur J Oper Res"},{"key":"9426_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/S0895480195281878","volume":"11","author":"VG Deineko","year":"1998","unstructured":"Deineko VG, Rudolf R, Woeginger GJ (1998) Sometimes travelling is easy: the master tour problem. SIAM J Discrete Math 11:81\u201393","journal-title":"SIAM J Discrete Math"},{"key":"9426_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-6377(97)00047-3","volume":"22","author":"VG Deineko","year":"1998","unstructured":"Deineko VG, Woeginger GJ (1998) A\u00a0solvable case of the quadratic assignment problem. Oper Res Lett 22:13\u201317","journal-title":"Oper Res Lett"},{"key":"9426_CR7","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a\u00a0guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9426_CR8","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.4153\/CJM-1975-104-6","volume":"27","author":"K Kalmanson","year":"1975","unstructured":"Kalmanson K (1975) Edgeconvex circuits and the travelling salesman problem. Can J Math 27:1000\u20131010","journal-title":"Can J Math"},{"key":"9426_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Proceedings of the complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Proceedings of the complexity of computer computations. Plenum Press, New York, pp 85\u2013104"},{"key":"9426_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1009881510868","volume":"3","author":"B Klinz","year":"1999","unstructured":"Klinz B, Woeginger GJ (1999) The Steiner tree problem in Kalmanson matrices and in Circulant matrices. J Comb Optim 3:51\u201358","journal-title":"J Comb Optim"},{"key":"9426_CR11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"FCR Spieksma","year":"1996","unstructured":"Spieksma FCR, Woeginger GJ (1996) Geometric three-dimensional assignment problems. Eur J Oper Res 91:611\u2013618","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9426-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T09:46:44Z","timestamp":1497952004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9426-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9426"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9426-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}