{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:56:26Z","timestamp":1774367786418,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"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":[[2005,6]]},"DOI":"10.1007\/s10878-005-1779-7","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T06:09:50Z","timestamp":1124518190000},"page":"401-432","source":"Crossref","is-referenced-by-count":8,"title":["An Improved Randomized Approximation Algorithm for Max TSP"],"prefix":"10.1007","volume":"9","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1779_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-69346-7_15","volume":"1412","author":"A.I. Barvinok","year":"1998","unstructured":"A.I. Barvinok, D.S. Johnson, G.J. Woeginger, and R. Woodroofe, \u201cFinding Maximum Length Tours under Polyhedral Norms,\u201d Proceedings of the Sixth International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 1412, pp. 195\u2013201, 1998.","journal-title":"Proceedings of the Sixth International Conference on Integer Programming and Combinatorial Optimization"},{"key":"1779_CR2","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"P. Chalasani","year":"1999","unstructured":"P. Chalasani and R. Motwani, \u201cApproximating Capacitated Routing and Delivery Problems,\u201d SIAM Journal on Computing, vol. 28, pp. 2133\u20132149, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"1779_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","volume":"67","author":"R. Hassin","year":"1998","unstructured":"R. Hassin and S. Rubinstein, \u201cAn Approximation Algorithm for the Maximum Traveling Salesman Problem,\u201d Information Processing Letters, vol. 67, pp. 125\u2013130, 1998.","journal-title":"Information Processing Letters"},{"key":"1779_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00097-1","volume":"75","author":"TSP","year":"2000","unstructured":"TSP,\u201d Information Processing Letters, vol. 75, pp. 181\u2013186, 2000.","journal-title":"Information Processing Letters"},{"key":"1779_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"TSP","year":"2002","unstructured":"TSP,\u201d Information Processing Letters, vol. 81, pp. 247\u2013251, 2002.","journal-title":"Information Processing Letters"},{"key":"1779_CR6","unstructured":"(in Russian),\u201d Upravlyaemye Sistemy, vol. 26, pp. 55\u201359, 1985."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1779-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1779-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1779-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:08Z","timestamp":1559261888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1779-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["1779"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1779-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}