{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:26Z","timestamp":1725549686324},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_31","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:31:47Z","timestamp":1268382707000},"page":"350-359","source":"Crossref","is-referenced-by-count":7,"title":["Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Shankar","family":"Ram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0196-6774(03)00112-3","volume":"50","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: An $\\frac 8{13}$ -approximation algorithm for the asymmetric maximum tsp. J. Algorithms\u00a050(1), 23\u201348 (2004)","journal-title":"J. Algorithms"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-45753-4_6","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Bl\u00e4ser","year":"2002","unstructured":"Bl\u00e4ser, M., Manthey, B.: Two approximation algorithms for 3-cycle covers. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 40\u201350. Springer, Heidelberg (2002)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with edge weights zero and one. Algorithmica (2005)","DOI":"10.1007\/s00453-004-1131-0"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1006\/jagm.1997.0861","volume":"24","author":"D. Breslauer","year":"1997","unstructured":"Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms\u00a024, 340\u2013353 (1997)","journal-title":"J. Algorithms"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"P. Chalasani","year":"1999","unstructured":"Chalasani, P., Motwani, R.: Approximating capacitated routing and delivery problems. SIAM J. Comput.\u00a028, 2133\u20132149 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR6","first-page":"799","volume":"12","author":"M.L. Fisher","year":"1979","unstructured":"Fisher, M.L., Nemhauser, L., Wolsey, L.A.: An analysis of approximations for finding a maximum weight Hamiltonian circuit. Networks\u00a012(1), 799\u2013809 (1979)","journal-title":"Networks"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphs. In: Proc. 44th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pp. 56\u201365 (2003)","DOI":"10.1109\/SFCS.2003.1238181"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Park, J.K., Stein, C.: Long tours and short superstrings. In: Proc. 35th Ann. IEEE Symp. on Foundations of Comput. Sci, FOCS (1994)","DOI":"10.1109\/SFCS.1994.365696"},{"key":"31_CR9","first-page":"55","volume":"26","author":"A.V. Kostochka","year":"1985","unstructured":"Kostochka, A.V., Serdyukov, A.I.: Polynomial algorithms with the estimates $\\frac{3}{4}$ and $\\frac {5}{6}$ for the traveling salesman problem of the maximum. Upravlyaemye Sistemy\u00a026, 55\u201359 (1985) (in Russian)","journal-title":"Upravlyaemye Sistemy"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/S0895480102402861","volume":"17","author":"M. Lewenstein","year":"2003","unstructured":"Lewenstein, M., Sviridenko, M.: A 5\/8 approximation algorithm for the maximum asymmetric TSP. SIAM J. Disc. Math.\u00a017(2), 237\u2013248 (2003)","journal-title":"SIAM J. Disc. Math."},{"key":"31_CR11","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs (1982)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Operations Research\u00a018, 1\u201311 (1993)","journal-title":"Math. Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:00Z","timestamp":1605625800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11534273_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}