{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T05:15:41Z","timestamp":1781154941943,"version":"3.54.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,7]],"date-time":"2013-06-07T00:00:00Z","timestamp":1370563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9634-8","type":"journal-article","created":{"date-parts":[[2013,6,6]],"date-time":"2013-06-06T08:46:14Z","timestamp":1370508374000},"page":"87-96","source":"Crossref","is-referenced-by-count":28,"title":["An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths"],"prefix":"10.1007","volume":"30","author":[{"given":"Marco","family":"Bender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,6,7]]},"reference":[{"issue":"1","key":"9634_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/PL00009285","volume":"25","author":"S Al-Binali","year":"1999","unstructured":"Al-Binali S (1999) A risk-reward framework for the competitive analysis of financial games. Algorithmica 25(1):99\u2013115","journal-title":"Algorithmica"},{"key":"9634_CR2","unstructured":"Bar-Noy A, Schieber B (1991) The Canadian Traveller Problem. In: Aggarwal A (ed) SODA. ACM\/SIAM, San Francisco, pp 261\u2013270"},{"key":"9634_CR3","doi-asserted-by":"crossref","unstructured":"Ben-David S, Borodin A (1994) A new measure for the study of on-line algorithms. Algorithmica 11(1): 73\u201391","DOI":"10.1007\/BF01294264"},{"key":"9634_CR4","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"9634_CR5","doi-asserted-by":"crossref","unstructured":"Huang Y, Liao CS (2012) The Canadian Traveller Problem revisited. In: Chao KM, Hsu TS, Lee DT (eds) Algorithms and computation. Lecture notes in computer science, vol 7676. Springer, Berlin, pp 352\u2013361","DOI":"10.1007\/978-3-642-35261-4_38"},{"issue":"1","key":"9634_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Shortest paths without a map. Theor Comput Sci 84(1):127\u2013150","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9634_CR7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"key":"9634_CR8","unstructured":"Su B, Xu Y (2004) Online recoverable Canadian Traveller Problem. In: Proceedings of the international conference on management science and engineering, pp 633\u2013639"},{"key":"9634_CR9","doi-asserted-by":"crossref","unstructured":"Su B, Xu Y, Xiao P, Tian L (2008) A risk-reward competitive analysis for the recoverable Canadian Traveller Problem. In: Proceedings of the second international conference on combinatorial optimization and applications (COCOA 2008). Springer, Berlin, pp 417\u2013426","DOI":"10.1007\/978-3-540-85097-7_39"},{"issue":"3","key":"9634_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ipl.2007.10.004","volume":"106","author":"S Westphal","year":"2008","unstructured":"Westphal S (2008) A note on the k-Canadian Traveller Problem. Inf Process Lett 106(3):87\u201389","journal-title":"Inf Process Lett"},{"issue":"2","key":"9634_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y Xu","year":"2009","unstructured":"Xu Y, Hu M, Su B, Zhu B, Zhu Z (2009) The Canadian Traveller Problem and its competitive analysis. J Combin Optim 18(2):195\u2013205","journal-title":"J Combin Optim"},{"key":"9634_CR12","doi-asserted-by":"crossref","unstructured":"Zhang H, Xu Y (2011) The k-Canadian Travelers Problem with communication. In: Atallah MJ, Li XY, Zhu B (eds) FAW-AAIM. Lecture notes in computer science, vol 6681. Springer, Berlin, pp 17\u201328","DOI":"10.1007\/978-3-642-21204-8_6"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9634-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9634-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9634-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9634-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,7]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9634"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9634-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,7]]}}}