{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:46:36Z","timestamp":1648547196138},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00323-1","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"845-852","source":"Crossref","is-referenced-by-count":0,"title":["Two short notes on the on-line travelling salesman: handling times and lookahead"],"prefix":"10.1016","volume":"289","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00323-1_BIB1","doi-asserted-by":"crossref","unstructured":"N. Ascheuer, S.O. Krumke, J. Rambau, Online dial-a-ride problems: minimizing the completion time, Proc. 17th STACS\u201900, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 639\u2013650.","DOI":"10.1007\/3-540-46541-3_53"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo, Serving requests with on-line routing, Proc. 4th SWAT\u201994, Lecture Notes in Computer Science, Vol. 824, Springer, Berlin, 1994, pp. 37\u201348.","DOI":"10.1007\/3-540-58218-5_4"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/s004530010071","article-title":"Algorithms for the on-line travelling salesman","volume":"29","author":"Ausiello","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB4","doi-asserted-by":"crossref","unstructured":"M. Blom, S.O. Krumke, W. de Paepe, L. Stougie, The online-TSP against fair adversaries, Proc. 4th CIAC 2000, Lecture Notes in Computer Science, Vol. 1767, Springer, Berlin, 2000, pp. 137\u2013149, full paper as Report of the Konrad-Zuse-Zentrum, Berlin, 2000.","DOI":"10.1007\/3-540-46521-9_12"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB5","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB6","doi-asserted-by":"crossref","unstructured":"D. Hauptmeier, S.O. Krumke, J. Rambau, The online dial-a-ride problem under reasonable load, Proc. 4th CIAC 2000, Lecture Notes in Computer Science, Vol. 1767, Springer, Berlin, 2000, pp. 125\u2013136.","DOI":"10.1007\/3-540-46521-9_11"},{"key":"10.1016\/S0304-3975(01)00323-1_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1018928911513","article-title":"Vehicle scheduling on a tree with release times and handling times","volume":"69","author":"Karuno","year":"1997","journal-title":"Ann. of Oper. Res."},{"key":"10.1016\/S0304-3975(01)00323-1_BIB8","unstructured":"S.O. Krumke, News from the online travelling repairman, preprint SC 00-08, Konrad-Zuse-Zentrum, Berlin, 2000."},{"key":"10.1016\/S0304-3975(01)00323-1_BIB9","unstructured":"M. Lippman, The online travelling salesman problem on the line, Master's Thesis, Department of OR, University of Amsterdam, 1999."},{"key":"10.1016\/S0304-3975(01)00323-1_BIB10","doi-asserted-by":"crossref","unstructured":"S. Seiden, A guessing game and randomized online algorithms, 32nd ACM STOC 2000, pp. 592\u2013601.","DOI":"10.1145\/335305.335385"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:20Z","timestamp":1554772940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003231"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00323-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}