{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:43Z","timestamp":1725549943127},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_18","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"179-190","source":"Crossref","is-referenced-by-count":6,"title":["Improved Approximation Algorithms for Metric Max TSP"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Takayuki","family":"Nagoya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-69346-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.I. Barvinok","year":"1998","unstructured":"Barvinok, A.I., Johnson, D.S., Woeginger, G.J., Woodroofe, R.: Finding Maximum Length Tours under Polyhedral Norms. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 195\u2013201. Springer, Heidelberg (1998)"},{"key":"18_CR2","unstructured":"Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved Deterministic Approximation Algorithms for Max\u00a0TSP. To appear in Information Processing Letters"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"R. Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: A 7\/8-Approximation Approximations for Metric Max\u00a0TSP. Information Processing Letters\u00a081, 247\u2013251 (2002)","journal-title":"Information Processing Letters"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 56\u201375 (2003)","DOI":"10.1109\/SFCS.2003.1238181"},{"key":"18_CR5","first-page":"55","volume":"26","author":"A.V. Kostochka","year":"1985","unstructured":"Kostochka, A.V., Serdyukov, A.I.: Polynomial Algorithms with the Estimates \n                  \n                    \n                  \n                  $\\frac{3}{4}$\n                 and \n                  \n                    \n                  \n                  $\\frac{5}{6}$\n                 for the Traveling Salesman Problem of Maximum (in Russian). Upravlyaemye Sistemy\u00a026, 55\u201359 (1985)","journal-title":"Upravlyaemye Sistemy"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:24Z","timestamp":1619507604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11561071_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}