{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:29Z","timestamp":1725516629087},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_39","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"417-426","source":"Crossref","is-referenced-by-count":8,"title":["A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem"],"prefix":"10.1007","author":[{"given":"Bing","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","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":"39_CR2","unstructured":"Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, pp. 261\u2013270 (1991)"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S.B. David","year":"1994","unstructured":"David, S.B., Borodin, A.: A new measure for the study of the on-line algorithm. Algorithmica\u00a011, 73\u201391 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"39_CR4","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.: A note on the k-Canadian traveller problem. Information Processing Letters\u00a0106(3), 87\u201389 (2008)","journal-title":"Information Processing Letters"},{"key":"39_CR5","doi-asserted-by":"crossref","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 Combinatorial Optimization, 4 (in press, 2008)","DOI":"10.1007\/s10878-008-9156-y"},{"key":"39_CR6","unstructured":"Su, B., Xu, Y.F.: Online recoverable Canadian traveller problem. In: Proceedings of the International Conference on Management Science and Engineering, pp. 633\u2013639 (2004)"},{"issue":"2","key":"39_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"39_CR8","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)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. In: Proceedings of the 22nd IEEE Symposium on Foundation of Computer Science, pp. 454\u2013463 (1990)","DOI":"10.1109\/FSCS.1990.89566"},{"key":"39_CR10","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, G.J.: Online algorithms: The state of art. Springer, Heidelberg (1998)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00009285","volume":"25","author":"S. Al-Binali","year":"1999","unstructured":"Al-Binali, S.: A risk-reward framework for the competitive analysis of financial games. Algorithmica\u00a025, 99\u2013115 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:21:55Z","timestamp":1606184515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}