{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:20Z","timestamp":1759639040364,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_18","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"141-151","source":"Crossref","is-referenced-by-count":25,"title":["Collective Tree Exploration"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing\u00a029, 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR2","unstructured":"Arkin, E., Bender, M., Fekete, S., Mitchell, J., Skutella, M.: The freeze-tag problem: How to wake up a swarm of robots. In: 13th ACM-SIAM Symp. on Disc. Alg. (SODA 2002), pp. 568\u2013577 (2002)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Arkin, E., Bender, M., Ge, D., He, S., Mitchell, J.: Improved approximation algorithms for the freeze-tag problem. In: 15th ACM Symp. on Par. in Alg. and Arch. (SPAA 2003), pp. 295\u2013303 (2003)","DOI":"10.1145\/777412.777465"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I. Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discr. Appl. Mathematics\u00a068, 17\u201332 (1996)","journal-title":"Discr. Appl. Mathematics"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0166-218X(97)89161-5","volume":"75","author":"I. Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: (p\u22121)\/(p+1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discr. Appl. Mathematics\u00a075, 201\u2013216 (1997)","journal-title":"Discr. Appl. Mathematics"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph learning by a mobile robot. In: 8th Conf. on Comput. Learning Theory (COLT 1995), pp. 321\u2013328 (1995)","DOI":"10.1145\/225298.225337"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1006\/jagm.1994.1039","volume":"17","author":"E. Bar-Eli","year":"1994","unstructured":"Bar-Eli, E., Berman, P., Fiat, A., Yan, R.: On-line navigation in a room. Journal of Algorithms\u00a017, 319\u2013341 (1994)","journal-title":"Journal of Algorithms"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. In: 30th Ann. Symp. on Theory of Comp. (STOC 1998), pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: 35th Ann. Symp. on Foundations of Comp. Science (FOCS 1996), pp. 75\u201385 (1996)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"18_CR10","unstructured":"Berman, P., Blum, A., Fiat, A., Karloff, H., Rosen, A., Saks, M.: Randomized robot navigation algorithms. In: 7th ACM-SIAM Symp. on Discrete Algorithms (SODA 1996), pp. 74\u201384 (1996)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM Journal on Computing\u00a026, 110\u2013137 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR12","first-page":"231","volume":"18","author":"M. Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Machine Learning\u00a018, 231\u2013254 (1995)","journal-title":"Machine Learning"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment I: the rectilinear case. Journal of the ACM\u00a045, 215\u2013245 (1998)","journal-title":"Journal of the ACM"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. of Graph Th.\u00a032, 265\u2013297 (1999)","journal-title":"J. of Graph Th."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-45749-6_35","volume-title":"Algorithms - ESA 2002","author":"A. Dessmark","year":"2002","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 374\u2013386. Springer, Heidelberg (2002)"},{"key":"18_CR16","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. In: 13th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 588\u2013597 (2002)"},{"key":"18_CR17","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 807\u2013814 (2001)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. on Computing\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J. on Computing"},{"key":"18_CR19","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-45471-3_27","volume-title":"Algorithm Theory - SWAT 2002","author":"A. Lopez-Ortiz","year":"2002","unstructured":"Lopez-Ortiz, A., Schuierer, S.: Online Parallel Heuristics and Robot Searching under the Competitive Framework. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 260\u2013269. Springer, Heidelberg (2002)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. of Algorithms\u00a033, 281\u2013295 (1999)","journal-title":"J. of Algorithms"},{"key":"18_CR22","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":"18_CR23","doi-asserted-by":"crossref","unstructured":"Rao, N.S.V., Hareti, S., Shi, W., Iyengar, S.S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Tech. Rep. ORNL\/TM-12410, Oak Ridge National Laboratory (July 1993)","DOI":"10.2172\/10180101"},{"key":"18_CR24","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/10705474_12","volume-title":"Sensor Based Intelligent Robots","author":"S. Schuierer","year":"1999","unstructured":"Schuierer, S.: On-line searching in geometric trees. In: Noltemeier, H., Christensen, H.I. (eds.) Dagstuhl Seminar 1998. LNCS (LNAI), vol.\u00a01724, pp. 220\u2013239. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:42:14Z","timestamp":1740840134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}