{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:43:24Z","timestamp":1774975404427,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_32","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"380-391","source":"Crossref","is-referenced-by-count":5,"title":["Canadians Should Travel Randomly"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Yamming","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Chung-Shou","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 261\u2013270 (1991)"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A.: A new measure for the study of online algorithms. Algorithmica\u00a011(1), 73\u201391 (1994)","journal-title":"Algorithmica"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bender, M., Westphal, S.: An optimal randomized online algorithm for the k-Canadian traveller problem on node-disjoint paths. Journal of Comb. Opt. (2013) (published online)","DOI":"10.1007\/s10878-013-9634-8"},{"key":"32_CR4","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)"},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing\u00a028(2), 652\u2013673 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-23719-5_37","volume-title":"Algorithms \u2013 ESA 2011","author":"A. Frieder","year":"2011","unstructured":"Frieder, A., Roditty, L.: An experimental study on approximating K shortest simple paths. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 433\u2013444. Springer, Heidelberg (2011)"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J. Hershberger","year":"2007","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans. on Algorithms\u00a03(4), 45 (2007)","journal-title":"ACM Trans. on Algorithms"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-35261-4_38","volume-title":"Algorithms and Computation","author":"Y. Huang","year":"2012","unstructured":"Huang, Y., Liao, C.S.: The Canadian traveller problem revisited. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 352\u2013361. Springer, Heidelberg (2012)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00453-010-9402-4","volume":"61","author":"K.H. Kao","year":"2011","unstructured":"Kao, K.H., Chang, J.M., Wang, Y.L., Juan, J.S.T.: A quadratic algorithm for finding next-to-shortest paths in graphs. Algorithmica\u00a061, 402\u2013418 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N. Katoh","year":"1982","unstructured":"Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for k shortest simple paths. Networks\u00a012(4), 411\u2013427 (1982)","journal-title":"Networks"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2004.06.020","volume":"92","author":"I. Krasikov","year":"2004","unstructured":"Krasikov, I., Noble, S.D.: Finding next-to-shortest paths in a graph. Information Processing Letters\u00a092, 117\u2013119 (2004)","journal-title":"Information Processing Letters"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0020-0190(97)00122-1","volume":"63","author":"K.N. Lalgudi","year":"1997","unstructured":"Lalgudi, K.N., Papaefthymiou, M.C.: Computing strictly-second shortest paths. Information Processing Letters\u00a063, 177\u2013181 (1997)","journal-title":"Information Processing Letters"},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science\u00a084(1), 127\u2013150 (1991)","journal-title":"Theoretical Computer Science"},{"key":"32_CR15","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, 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ipl.2007.10.004","volume":"106","author":"S. Westphal","year":"2008","unstructured":"Westphal, S.: A note on the k-Canadian traveller problem. Information Processing Letters\u00a0106, 87\u201389 (2008)","journal-title":"Information Processing Letters"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y.F. Xu","year":"2009","unstructured":"Xu, Y.F., Hu, M.L., Su, B., Zhu, B.H., Zhu, Z.J.: The Canadian traveller problem and its competitive analysis. Journal of Comb. Opt.\u00a018, 195\u2013205 (2009)","journal-title":"Journal of Comb. Opt."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:04:17Z","timestamp":1558908257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}