{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T09:06:55Z","timestamp":1777194415157,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10878-008-9156-y","type":"journal-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T12:00:49Z","timestamp":1207656049000},"page":"195-205","source":"Crossref","is-referenced-by-count":41,"title":["The canadian traveller problem and its competitive analysis"],"prefix":"10.1007","volume":"18","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Maolin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Su","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Zhijun","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,9]]},"reference":[{"issue":"1","key":"9156_CR1","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":"9156_CR2","unstructured":"Bar-Noy A, Schieber B (1991) The Canadian traveller problem. In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms, pp 261\u2013270"},{"issue":"3","key":"9156_CR3","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 traveler problem. Inf Process Lett 106(3):87\u201389","journal-title":"Inf Process Lett"},{"issue":"4","key":"9156_CR4","first-page":"261","volume":"18","author":"Z Zhu","year":"2003","unstructured":"Zhu Z, Xu Y, Liu C (2003) Scheduling for on-line routing problem and its competitive strategy analysis. J\u00a0Syst Eng 18(4):261\u2013270. (In Chinese)","journal-title":"J\u00a0Syst Eng"},{"issue":"3","key":"9156_CR5","first-page":"207","volume":"26","author":"M Hu","year":"2005","unstructured":"Hu M (2005) Comparison Strategy and its competitive ratio analysis of scheduling for on-line routing. J\u00a0Ningxia Univ 26(3):207\u2013210. (In Chinese)","journal-title":"J\u00a0Ningxia Univ"},{"issue":"5","key":"9156_CR6","first-page":"773","volume":"4","author":"E Takimoto","year":"2003","unstructured":"Takimoto E, Warmuth M (2003) Path kernels and multiplicative updates. J\u00a0Mach Learn Res 4(5):773\u2013818","journal-title":"J\u00a0Mach Learn Res"},{"key":"9156_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A Kalai","year":"2005","unstructured":"Kalai A, Vempala S (2005) Efficient algorithms for online decision problems. J Comput Syst Sci 71:291\u2013307","journal-title":"J Comput Syst Sci"},{"key":"9156_CR8","doi-asserted-by":"crossref","unstructured":"Blum A, Even-Dar E, Ligett K (2006) Routing without regret: on convergence to Nash equilibria of regret minimizing algorithms in routing games. In: Proceedings of the 25th annual ACM symposium on principles distributed computing, pp 45\u201352","DOI":"10.1145\/1146381.1146392"},{"issue":"2","key":"9156_CR9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"key":"9156_CR10","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":"9156_CR11","unstructured":"Fiat A, Rabani Y, Ravid Y (1998) Competitive k-server algorithms. In: Proceedings of the 22nd IEEE symposium on foundation of computer science, pp 454\u2013463"},{"key":"9156_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms: The state of art","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger GJ (1998) Online algorithms: The state of art. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9156-y.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:03:18Z","timestamp":1555560198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9156-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9156"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9156-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,9]]}}}