{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T16:10:12Z","timestamp":1736525412313,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_11","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"95-103","source":"Crossref","is-referenced-by-count":2,"title":["An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"key":"11_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11554714_1","volume-title":"Comparative Genomics","author":"A. Bachrach","year":"2005","unstructured":"Bachrach, A., Chen, K., Harrelson, C., Rao, S., Shah, A.: Lower Bounds for Maximum Parsimony with Gene Order Data. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 1\u201310. Springer, Heidelberg (2005)"},{"key":"11_CR3","unstructured":"Bl\u00e4ser, M.: A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality. In: Proc. of ACM-SIAM SODA, pp. 638\u2013645 (2002)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-63307-3_51","volume-title":"Algorithms and Data Structures","author":"M. Charikar","year":"1997","unstructured":"Charikar, M., Motwani, R., Raghavan, P., Silverstein, C.: Constrained TSP and lower power computing. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 104\u2013115. Springer, Heidelberg (1997)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Goemans, M., Karloff, H.: On the Integrality Ratio for Asymmetric TSP. In: Proc. of IEEE FOCS, pp. 101\u2013107 (2004)","DOI":"10.1109\/FOCS.2004.45"},{"key":"11_CR6","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, CMU (1976)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. of Oper. Res.\u00a04, 233\u2013235 (1979)","journal-title":"Math. of Oper. Res."},{"key":"11_CR8","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, M.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks\u00a012, 23\u201339 (1982)","journal-title":"Networks"},{"volume-title":"Traveling Salesman Problem and Its Variations","year":"2002","key":"11_CR9","unstructured":"Gutin, G., Punnen, A.P. (eds.): Traveling Salesman Problem and Its Variations. Springer, Berlin (2002)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010045","volume":"28","author":"N. Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica\u00a028, 422\u2013437 (2000); Preliminary version in: Proc. of FSTTCS (1998)","journal-title":"Algorithmica"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.: Analysis of Christofides heuristic: Some paths are more difficult than cycles. Operations Research Letters\u00a010, 291\u2013295 (1991)","journal-title":"Operations Research Letters"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multidigraphs. Journal of ACM\u00a052, 602\u2013626 (2005)","journal-title":"Journal of ACM"},{"key":"11_CR13","unstructured":"Kleinberg, J., Williamson, D.: Unpublished note (1998)"},{"key":"11_CR14","unstructured":"Lam, F., Newman, A.: Traveling Salesman Path Problems (manuscript April 2005)"},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","key":"11_CR15","unstructured":"Lawler, E., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd., Chichester (1985)"},{"key":"11_CR16","unstructured":"Williamson, D.: Lecture Notes on Approximation Algorithms. IBM Research Report RC 21273 (February 1999)"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"N. Young","year":"1991","unstructured":"Young, N., Tarjan, R., Orlin, J.: Faster parametric shortest path and minimum balance algorithms. Networks\u00a021(2), 205\u2013221 (1991)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:29:28Z","timestamp":1736522968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11830924_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}