{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T23:04:14Z","timestamp":1791327854178,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540377917","type":"print"},{"value":"9783540377931","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_29","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T06:25:12Z","timestamp":1156487112000},"page":"327-338","source":"Crossref","is-referenced-by-count":19,"title":["Smart Robot Teams Exploring Sparse Trees"],"prefix":"10.1007","author":[{"given":"M.","family":"Dynia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. Meyer auf","family":"der Heide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Schindelhauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","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, New York (1998)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Rao, N., Kareti, S., Shi, W., Iyenagar, S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical Report ORNL\/TM-12410 (1993)","DOI":"10.2172\/10180101"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. Frederickson","year":"1978","unstructured":"Frederickson, G., Hecht, M., Kim, C.: Approximation algorithms for some routing problems. SIAM Journal on Computing\u00a07, 178\u2013193 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1020759332183","volume":"110","author":"I. Averbakh","year":"2002","unstructured":"Averbakh, I., Berman, O.: Minmax p-traveling salesmen location problems on a tree. Annals of Operations Research\u00a0110, 55\u201368 (2002)","journal-title":"Annals of Operations Research"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M. Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol.\u00a03894, pp. 341\u2013351. Springer, Heidelberg (2006)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G. Even","year":"2004","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Research Letters\u00a032, 309\u2013315 (2004)","journal-title":"Operations Research Letters"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0166-218X(97)89161-5","volume":"75","author":"I. Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: (p - 1)\/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics\u00a075, 201\u2013216 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR8","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. Discrete Applied Mathematics\u00a068, 17\u201332 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. FOCS 1994, pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"29_CR10","first-page":"269","volume-title":"Proc. 30th Symp. Theory of Computing","author":"M. Bender","year":"1998","unstructured":"Bender, M., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: Proc. 30th Symp. Theory of Computing, pp. 269\u2013278. ACM, New York (1998)"},{"key":"29_CR11","first-page":"316","volume-title":"SODA 1998: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms","author":"P. Panaite","year":"1998","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. In: SODA 1998: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pp. 316\u2013322. Society for Industrial and Applied Mathematics, Philadelphia (1998)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Information and Computation\u00a0152, 155\u2013172 (1999)","journal-title":"Information and Computation"},{"key":"29_CR13","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":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11561071_4","volume-title":"Algorithms \u2013 ESA 2005","author":"R. Fleischer","year":"2005","unstructured":"Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 11\u201322. Springer, Heidelberg (2005)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24698-5_18","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 141\u2013151. Springer, Heidelberg (2004)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11429647_13","volume-title":"Structural Information and Communication Complexity","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Rajsbaum, S., Tixeuil, S.: Space lower bounds for graph exploration via reduced automata. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 140\u2013154. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T16:07:29Z","timestamp":1555776449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11821069_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}