{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:49:52Z","timestamp":1676821792067},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T00:00:00Z","timestamp":1291075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11590-010-0266-y","type":"journal-article","created":{"date-parts":[[2010,11,29]],"date-time":"2010-11-29T05:08:51Z","timestamp":1291007331000},"page":"415-420","source":"Crossref","is-referenced-by-count":1,"title":["On the maximum TSP with \u03b3-parameterized triangle inequality"],"prefix":"10.1007","volume":"6","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaomin","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,30]]},"reference":[{"issue":"4","key":"266_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10878-006-9023-7","volume":"13","author":"Z.-Z. Chen","year":"2007","unstructured":"Chen Z.-Z., Nagoya T.: Improved approximation algorithms for metric max TSP. J. Comb. Optim. 13(4), 321\u2013336 (2007)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"266_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.ipl.2005.03.011","volume":"95","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen Z.-Z., Okamoto Y., Wang L.: Improved deterministic approximation algorithms for Max TSP. Inf. Process. Lett. 95(2), 333\u2013342 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"266_CR3","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/opre.27.4.799","volume":"27","author":"M.L. Fisher","year":"1979","unstructured":"Fisher M.L., Nemhauser G.L., Wolsey L.A.: An analysis of approximation for finding a maximum weight Hamiltonian circuit. Oper. Res. 27(4), 799\u2013809 (1979)","journal-title":"Oper. Res."},{"key":"266_CR4","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M.: Encyclopedia of optimization, 2nd edn. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0"},{"key":"266_CR5","unstructured":"Hartvigsen, D.: Extensions of matching theory. Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, PA (1984)"},{"issue":"5","key":"266_CR6","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.: A 7\/8-approximation algorithm for metric Max TSP. Inf. Process. Lett. 81(5), 247\u2013251 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"266_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00097-1","volume":"75","author":"R. Hassin","year":"2000","unstructured":"Hassin R., Rubinstein S.: Better approximations for max TSP. Inf. Process. Lett 75(4), 181\u2013186 (2000)","journal-title":"Inf. Process. Lett"},{"key":"266_CR8","first-page":"55","volume":"26","author":"A.V. Kostochka","year":"1985","unstructured":"Kostochka A.V., Serdyukov A.I.: Polynomial algorithms with the estimates 3\/4 and 5\/6 for the traveling salesman problem of the maximum (in Russian). Upravlyaemye Sistemy 26, 55\u201359 (1985)","journal-title":"Upravlyaemye Sistemy"},{"key":"266_CR9","doi-asserted-by":"crossref","unstructured":"Kowalik, L., Mucha, M.: 35\/44-Approximation for asymmetric maximum TSP with triangle inequality. Algorithmica. doi: 10.1007\/s00453-009-9306-3","DOI":"10.1007\/s00453-009-9306-3"},{"issue":"47\u201349","key":"266_CR10","doi-asserted-by":"crossref","first-page":"5000","DOI":"10.1016\/j.tcs.2009.07.051","volume":"410","author":"L. Kowalik","year":"2009","unstructured":"Kowalik L., Mucha M.: Deterministic 7\/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410(47\u201349), 5000\u20135009 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"266_CR11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-642-03685-9_23","volume":"5687","author":"K. Paluch","year":"2009","unstructured":"Paluch K., Mucha M., Madry A.: A 7\/9 approximation algorithm for the maximum traveling salesman problem. Lect. Notes Comput. Sci. 5687, 298\u2013311 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"266_CR12","unstructured":"Pardalos, P.M., Du, D.: Handbook of Combinatorial Optimization. Kluwer Academic Publishers. Volumes 1, 2, and 3 (1998), Supplement Volume A (1999), Supplement Volume B (2001)"},{"key":"266_CR13","first-page":"80","volume":"25","author":"A.I. Serdyukov","year":"1984","unstructured":"Serdyukov A.I.: The traveling salesman problem of the maximum (in Russian). Upravlyaemye Sistemy 25, 80\u201386 (1984)","journal-title":"Upravlyaemye Sistemy"},{"issue":"26\u201328","key":"266_CR14","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.tcs.2010.03.012","volume":"411","author":"T. Zhang","year":"2010","unstructured":"Zhang T., Yin Y., Li J.: An improved approximation algorithm for the maximum TSP. Theor. Comput. Sci. 411(26\u201328), 2537\u20132541 (2010)","journal-title":"Theor. Comput. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0266-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0266-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0266-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T12:47:45Z","timestamp":1559825265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0266-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,30]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["266"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0266-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,30]]}}}