{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:45:52Z","timestamp":1751633152940,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238181","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"56-65","source":"Crossref","is-referenced-by-count":21,"title":["Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs"],"prefix":"10.1109","author":[{"given":"H.","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Shafrir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"80","article-title":"An algorithm with an estimate for the travelling salesman problem of the maximum","volume":"25","author":"serdyukov","year":"1984","journal-title":"Upravlyaemye Sistemy"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90167-3"},{"key":"17","first-page":"646","article-title":"Approximating assymetric maximum TSP","author":"lewenstein","year":"2003","journal-title":"SIAM Journal of Discrete Mathematics Preliminary Version Appeared in Proceedings of SODA03"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90044-8"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.1"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90103-3"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365696"},{"key":"16","first-page":"55","article-title":"Polynomial algorithms with the estimates 3\/4 and 5\/6 for the traveling salesman problem of the maximum","volume":"26","author":"kostochka","year":"1985","journal-title":"Upravlyaemye Sistemy"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00097-1"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00234-4"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_17"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120103"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796324661"},{"key":"3","first-page":"64","article-title":"An 8\/13 approximation algorithm for the asymmetric max-TSP","author":"bla?ser","year":"0","journal-title":"Proc of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2002"},{"key":"20","first-page":"79","article-title":"An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space","author":"serdyukov","year":"1987","journal-title":"Upravlyaemye Sistemy"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876640"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00446-5"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-1001-6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/179812.179818"},{"key":"6","first-page":"368","article-title":"Computing cycle covers without short cycles","volume":"2161","author":"bla?ser","year":"2001","journal-title":"Proceedings of the European Symposium on Algorithms (ESA) LNCS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45753-4_6"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1383369.1383378"},{"article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","year":"1976","author":"christofides","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0861"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238181.pdf?arnumber=1238181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:08:14Z","timestamp":1489424894000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238181","relation":{},"subject":[]}}