{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:09:22Z","timestamp":1794380962359,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228943","type":"print"},{"value":"9783540278214","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_6","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:54:06Z","timestamp":1284476046000},"page":"61-71","source":"Crossref","is-referenced-by-count":24,"title":["A 3\/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(02)00446-5","volume":"85","author":"N. Alon","year":"2003","unstructured":"Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inform. Processing Letters\u00a085, 301\u2013302 (2003)","journal-title":"Inform. Processing Letters"},{"issue":"1","key":"6_CR2","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 8\/13-approximation algorithm for the maximum asymmetric TSP. J. Algorithms\u00a050(1), 23\u201348 (2004)","journal-title":"J. Algorithms"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-44676-1_31","volume-title":"Algorithms - ESA 2001","author":"M. Bl\u00e4ser","year":"2001","unstructured":"Bl\u00e4ser, M., Siebert, B.: Computing cycle covers without short cycles. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 369\u2013379. Springer, Heidelberg (2001)"},{"key":"6_CR4","unstructured":"Bl\u00e4ser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with edge weights zero and one. (2003) (manuscript)"},{"key":"6_CR5","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":"6_CR6","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), pp. 166\u2013177 (1994)","DOI":"10.1109\/SFCS.1994.365696"},{"key":"6_CR7","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. Discrete Math.\u00a017, 237\u2013248 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR8","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. Oper. Res.\u00a018, 1\u201311 (1993)","journal-title":"Math. Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(92)90103-3","volume":"44","author":"S. Vishwanathan","year":"1992","unstructured":"Vishwanathan, S.: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Proc. Letters\u00a044, 297\u2013302 (1992)","journal-title":"Inform. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:00Z","timestamp":1619998200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_6","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99805","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}