{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:09:06Z","timestamp":1773148146561,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,12,8]],"date-time":"2006-12-08T00:00:00Z","timestamp":1165536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,4,2]]},"DOI":"10.1007\/s10878-006-9023-7","type":"journal-article","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T11:41:20Z","timestamp":1165491680000},"page":"321-336","source":"Crossref","is-referenced-by-count":11,"title":["Improved approximation algorithms for metric MaxTSP"],"prefix":"10.1007","volume":"13","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Takayuki","family":"Nagoya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,8]]},"reference":[{"key":"9023_CR1","doi-asserted-by":"crossref","unstructured":"Barvinok AI, Johnson DS, Woeginger GJ, Woodroofe R (1998) Finding maximum length tours under polyhedral norms. Proceedings of the Sixth International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 1412:195\u2013201","DOI":"10.1007\/3-540-69346-7_15"},{"key":"9023_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10878-005-1779-7","volume":"9","author":"ZZ Chen","year":"2005","unstructured":"Chen ZZ, Wang L (2005) An improved randomized approximation algorithm for Max TSP. J Comb Optim 9:401\u2013432","journal-title":"J Comb Optim"},{"key":"9023_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.ipl.2005.03.011","volume":"95","author":"ZZ Chen","year":"2005","unstructured":"Chen ZZ, Okamoto Y, Wang L (2005) Improved deterministic approximation algorithms for Max TSP. Inf Process Lett 95:333\u2013342","journal-title":"Inf Process Lett"},{"key":"9023_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"R Hassin","year":"2002","unstructured":"Hassin R, Rubinstein S (2002) A 7\/8-Approximation approximations for metric Max TSP. Inf Process Lett 81:247\u2013251","journal-title":"Inf Process Lett"},{"key":"9023_CR5","doi-asserted-by":"crossref","unstructured":"Kaplan H, Lewenstein M, Shafrir N, Sviridenko M (2003) Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Proceeding of the 44th Annual IEEE Symposium on Foundations Computer Science pp 56\u201375","DOI":"10.1109\/SFCS.2003.1238181"},{"key":"9023_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","volume":"6","author":"RM Karp","year":"1986","unstructured":"Karp RM, Upfal E, Wigderson A (1986) Constructing a perfect matching is in random NC. Combinatorica 6:35\u201348","journal-title":"Combinatorica"},{"key":"9023_CR7","unstructured":"Kostochka AV, Serdyukov AI (1985) Polynomial algorithms with the estimates $$\\frac{3}{4}$$ and $$\\frac{5}{6}$$ for the traveling salesman problem of maximum (in Russian). Upravlyaemye Sistemy 26:55\u201359"},{"key":"9023_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley K, Vazirani UV, Vazirani VV (1987) Matching is as easy as matrix inversion. Combinatorica 7:105\u2013113","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9023-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9023-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9023-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:10Z","timestamp":1559261890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9023-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,8]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,4,2]]}},"alternative-id":["9023"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9023-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,8]]}}}