{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:05Z","timestamp":1725564605162},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_41","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["Worst Case Performance of an Approximation Algorithm for Asymmetric TSP"],"prefix":"10.1007","author":[{"given":"Anna","family":"Palbom","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Bl\u00e4ser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. In: Proceedings 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 638\u2013645 (2003)"},{"key":"41_CR2","unstructured":"Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem Tech. Rep. 388, GSIA, Carnegie Mellon Univerity (1976)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A.M. Frieze","year":"1982","unstructured":"Frieze, A.M., Galbiati, G., Maffioli, F.: On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem. Network\u00a012, 23\u201339 (1982)","journal-title":"Network"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proceedings of Symposium on Foundations of Computer Science (FOCS), pp. 56\u201365 (2003)","DOI":"10.1109\/SFCS.2003.1238181"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"41_CR6","unstructured":"Karp, R.M.: The fast approximate solution of hard combinatorial problems. In: Proceedings 6th South Eastern Conference on Combinatorics, Graph Theory and Computing, pp. 15\u201321, Utilitas Mathematica, Winnipeg (1975)"},{"key":"41_CR7","unstructured":"Papadimitriou, C.H., Vempala, S.: On the approximability of the traveling salesman problem (manuscript) (May 2002), \n                    \n                      http:\/\/www.cs.berkeley.edu\/~christos\/tsp.ps"},{"issue":"3","key":"41_CR8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S.K. Sahni","year":"1976","unstructured":"Sahni, S.K., Gonzalez, T.: P-complete approximation problems. Journal of the Assoc. Comput. Mach.\u00a023(3), 555\u2013565 (1976)","journal-title":"Journal of the Assoc. Comput. Mach."},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(94)90107-4","volume":"51","author":"G. Schaar","year":"1994","unstructured":"Schaar, G.: Remarks on Hamiltonian properties of powers of digraphs. Discrete Applied Mathematics\u00a051, 181\u2013186 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:08:41Z","timestamp":1553058521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}