{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:20Z","timestamp":1781345720270,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281931","type":"print"},{"value":"9783540318736","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_44","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:00:06Z","timestamp":1127815206000},"page":"504-515","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Approximation Algorithm for TSP with Distances One and Two"],"prefix":"10.1007","author":[{"given":"M.","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. Shankar","family":"Ram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Bl\u00e4ser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. In: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), pp. 639\u2013647 (2003)"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-27821-4_6","volume-title":"Proc. 7th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: A 3\/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 61\u201371. Springer, Heidelberg (2004)"},{"key":"44_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, GSIA, Carnegie Mellon University (1976)"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A. Frieze","year":"1982","unstructured":"Frieze, A., Galbiati, G., Maffioli, F.: On the worst\u2013case performance of some algorithms for the asymmetric travelling salesman problem. Networks\u00a012, 23\u201339 (1982)","journal-title":"Networks"},{"key":"44_CR5","unstructured":"Hartvigsen, D.B.: Extensions of matching theory. PhD thesis, Carnegie\u2013Mellon University (1984)"},{"key":"44_CR6","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: A 2\/3 approximation for maximum asymmetric TSP by decomposing directed regular multi graphs. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS (2003)"},{"key":"44_CR7","unstructured":"Manthey, B.: On Approximating Restricted Cycle Covers. arXiv:cs.CC\/0504038 v1, April 11 (2005)"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. of Operations Research\u00a018, 1\u201311 (1993)","journal-title":"Math. of Operations Research"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM\u00a023, 555\u2013565 (1976)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:52:47Z","timestamp":1619491967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11537311_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}