{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:28Z","timestamp":1725549688401},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_27","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:31:47Z","timestamp":1268382707000},"page":"306-317","source":"Crossref","is-referenced-by-count":5,"title":["The On-line Asymmetric Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Bonifaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/3-540-46541-3_53","volume-title":"STACS 2000","author":"N. Ascheuer","year":"2000","unstructured":"Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: Minimizing the completion time. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 639\u2013650. Springer, Heidelberg (2000)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Demange, M., Laura, L., Paschos, V.: Algorithms for the on-line quota traveling salesman problem. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 290\u2013299. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27798-9_32"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman. Algorithmica\u00a029(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M. Blom","year":"2001","unstructured":"Blom, M., Krumke, S.O., de Paepe, W.E., Stougie, L.: The online-TSP against fair adversaries. INFORMS Journal on Computing\u00a013, 138\u2013148 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"27_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00261-9","volume":"268","author":"E. Feuerstein","year":"2001","unstructured":"Feuerstein, E., Stougie, L.: On-line single-server dial-a-ride problems. Theoretical Computer Science\u00a0268, 91\u2013105 (2001)","journal-title":"Theoretical Computer Science"},{"volume-title":"Online Algorithms: The State of the Art","year":"1998","key":"27_CR7","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. Springer, Heidelberg (1998)"},{"issue":"1","key":"27_CR8","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. Networks\u00a012(1), 23\u201339 (1982)","journal-title":"Networks"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","key":"27_CR9","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)"},{"key":"27_CR10","first-page":"225","volume-title":"Network Models, Handbook on Operations Research and Management Science","author":"M. J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Ball, M.O., Magnanti, T., Monma, C.L., Nemhauser, G. (eds.) Network Models, Handbook on Operations Research and Management Science, vol.\u00a07, pp. 225\u2013230. Elsevier, Amsterdam (1995)"},{"key":"27_CR11","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 Symp. Foundations of Computer Science, pp. 56\u201366 (2003)","DOI":"10.1109\/SFCS.2003.1238181"},{"key":"27_CR12","unstructured":"Krumke, S.O.: Online optimization: Competitive analysis and beyond. Habilitation Thesis, Technical University of Berlin (2001)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-44683-4_43","volume-title":"Mathematical Foundations of Computer Science 2001","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 487\u2013499. Springer, Heidelberg (2001)"},{"key":"27_CR14","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.R., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"key":"27_CR15","unstructured":"Lipmann, M.: On-Line Routing. PhD thesis, Technical University of Eindhoven (2003)"},{"issue":"1","key":"27_CR16","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. Mathematics of Operations Research\u00a018(1), 1\u201311 (1993)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.F.: P-complete approximation problems. Journal of the ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"Journal of the ACM"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:57Z","timestamp":1605625797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11534273_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}