{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:12Z","timestamp":1759639032703},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_6","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"17-28","source":"Crossref","is-referenced-by-count":6,"title":["The k-Canadian Travelers Problem with Communication"],"prefix":"10.1007","author":[{"given":"Huili","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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, 127\u2013150 (1991)","journal-title":"Theoretical Computer Science"},{"key":"6_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, San Francisco (1991)"},{"key":"6_CR3","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 Traveler Problem. Information Processing Letter\u00a0106, 87\u201389 (2008)","journal-title":"Information Processing Letter"},{"key":"6_CR4","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 combinatorial optimization\u00a018, 195\u2013205 (2009)","journal-title":"Journal of combinatorial optimization"},{"key":"6_CR5","first-page":"477","volume":"7","author":"B. Su","year":"2004","unstructured":"Su, B., Xu, Y.F.: Online recoverable Canadian Traveler Problem on a road. Information\u00a07, 477\u2013486 (2004)","journal-title":"Information"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1996.0012","volume":"20","author":"A. Itai","year":"1996","unstructured":"Itai, A., Shachnai, H.: Adaptive source routing in high-speed networks. Journal of Algorithms\u00a020, 218\u2013243 (1996)","journal-title":"Journal of Algorithms"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Burgard, W., Fox, D., Moors, M., Simmons, R., Thrun, S.: Collaborative multi-robot exploration. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), San Francisco, pp. 476\u2013481 (2000)","DOI":"10.1109\/ROBOT.2000.844100"},{"key":"6_CR8","unstructured":"Simmons, R., Apfelbaum, D., Burgard, W., Fox, M., Moors, D., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, Austin, pp. 852\u2013858 (2000)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Lita, L.V., Schulte, J., Thrun, S.: A System for Multi-Agent Coordination in Uncertain Environments. In: Proceedings of the Fifth International Conference on Autonomous Agents, Montreal, pp. 21\u201322 (2001)","DOI":"10.1145\/375735.375806"},{"key":"6_CR10","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)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:33:03Z","timestamp":1553725983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}