{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:19:26Z","timestamp":1762521566662},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T00:00:00Z","timestamp":1366675200000},"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,5]]},"DOI":"10.1007\/s10878-013-9614-z","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T04:20:38Z","timestamp":1366604438000},"page":"701-712","source":"Crossref","is-referenced-by-count":11,"title":["Generalized Canadian traveller problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Chung-Shou","family":"Liao","sequence":"first","affiliation":[]},{"given":"Yamming","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,23]]},"reference":[{"key":"9614_CR1","unstructured":"Bar-Noy A, Schieber B (1991) The Canadian traveller problem. Proceedings of the 2nd ACM-SIAM symposium on discrete algorithms (SODA), pp. 261\u2013270"},{"key":"9614_CR2","doi-asserted-by":"crossref","unstructured":"Ben-David S, Borodin A (1994) A new measure for the study of online algorithms. Algorithmica 11(1): 73\u201391","DOI":"10.1007\/BF01294264"},{"key":"9614_CR3","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"},{"issue":"1","key":"9614_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numeri Math 1(1):269\u2013271","journal-title":"Numeri Math"},{"key":"9614_CR5","unstructured":"Karger D, Nikolova E (2008) Exact algorithms for the Canadian traveller problem on paths and trees. Technical report, MIT Computer Science and Artificial Intelligence Lab. URL http:\/\/hdl.handle.net\/1721.1\/40093"},{"issue":"1","key":"9614_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"},{"key":"9614_CR7","doi-asserted-by":"crossref","unstructured":"Sleator D, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28: 202\u2013208","DOI":"10.1145\/2786.2793"},{"key":"9614_CR8","unstructured":"Su B, Xu YF (2004) Online recoverable Canadian traveller problem. Proceedings of the international conference on management science and engineering, pp. 633\u2013639"},{"key":"9614_CR9","unstructured":"Su B, Xu YF, Xiao P, Tian L (2008) A risk-reward competitive analysis for the recoverable Canadian traveller problem. Proceedings of the 2nd conference on combinatorial optimization and applications (COCOA). LNCS 5165:417\u2013426"},{"key":"9614_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:87\u201389","journal-title":"Inf Process Lett"},{"key":"9614_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"YF Xu","year":"2009","unstructured":"Xu YF, Hu ML, Su B, Zhu BH, Zhu ZJ (2009) The Canadian traveller problem and its competitive analysis. J Comb Optim 18:195\u2013205","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9614-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9614-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9614-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9614-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,23]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9614"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9614-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,23]]}}}