{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:06:23Z","timestamp":1746331583515,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096193"},{"type":"electronic","value":"9783319096209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09620-9_4","type":"book-chapter","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T02:07:37Z","timestamp":1405476457000},"page":"23-36","source":"Crossref","is-referenced-by-count":5,"title":["The Beachcombers\u2019 Problem: Walking and Searching with Mobile Robots"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fraser","family":"MacQuarrie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Koopman, B.O.: Search and screening. Operations Evaluation Group, Office of the Chief of Naval Operations, Navy Department (1946)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 355\u2013361. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89554"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"4_CR4","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 J. Comput.\u00a029(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"4_CR5","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous, vol.\u00a055. Kluwer Academic Publishers (2002)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Information and Computation\u00a0106, 234 (1993)","journal-title":"Information and Computation"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ic.2013.02.001","volume":"225","author":"J. Czyzowicz","year":"2013","unstructured":"Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Worst-case optimal exploration of terrains with obstacles. Inf. Comput.\u00a0225, 16\u201328 (2013)","journal-title":"Inf. Comput."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment (extended abstract). In: FOCS, pp. 298\u2013303 (1991)","DOI":"10.1109\/SFCS.1991.185382"},{"key":"4_CR9","unstructured":"Bellman, R.: An optimal search problem. Bull. Am. Math. Soc., 270 (1963)"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A. Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Israel Journal of Mathematics\u00a02(4), 221\u2013228 (1964)","journal-title":"Israel Journal of Mathematics"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theoretical Computer Science\u00a0361(2), 342\u2013355 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"4_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Math. Program.\u00a097(1-2), 3\u201326 (2003)","journal-title":"Math. Program."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Albers, S., Schmelzer, S.: Online algorithms - what is it worth to know the future? In: Algorithms Unplugged, pp. 361\u2013366 (2011)","DOI":"10.1007\/978-3-642-15328-0_37"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0029571","volume-title":"Online Algorithms","author":"P. Berman","year":"1998","unstructured":"Berman, P.: On-line searching and navigation. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms 1996. LNCS, vol.\u00a01442, pp. 232\u2013241. Springer, Heidelberg (1998)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1137\/060662204","volume":"38","author":"R. Fleischer","year":"2008","unstructured":"Fleischer, R., Kamphans, T., Klein, R., Langetepe, E., Trippen, G.: Competitive online approximation of the optimal search ratio. SIAM J. Comput.\u00a038(3), 881\u2013898 (2008)","journal-title":"SIAM J. Comput."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-39212-2_46","volume-title":"Automata, Languages, and Programming","author":"D. Dereniowski","year":"2013","unstructured":"Dereniowski, D., Disser, Y., Kosowski, A., Paj\u0105k, D., Uzna\u0144ski, P.: Fast collaborative graph exploration. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 520\u2013532. Springer, Heidelberg (2013)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16926-7_20","volume-title":"Graph Theoretic Concepts in Computer Science","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 208\u2013219. Springer, Heidelberg (2010)"},{"issue":"1-3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2007.05.011","volume":"385","author":"S. Das","year":"2007","unstructured":"Das, S., Flocchini, P., Kutten, S., Nayak, A., Santoro, N.: Map construction of unknown graphs by multiple agents. Theor. Comput. Sci.\u00a0385(1-3), 34\u201348 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks\u00a048(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Katoh, N., Langerman, S., Tanigawa, S.: Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. (2012)","DOI":"10.1007\/s10878-012-9571-y"},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1921621.1921627","volume":"7","author":"G. Wang","year":"2011","unstructured":"Wang, G., Irwin, M.J., Fu, H., Berman, P., Zhang, W., Porta, T.L.: Optimizing sensor movement planning for energy efficiency. ACM Transactions on Sensor Networks\u00a07(4), 33 (2011)","journal-title":"ACM Transactions on Sensor Networks"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Burman, J., Clement, J., Kutten, S.: On utilizing speed in networks of mobile agents. In: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 305\u2013314. ACM (2010)","DOI":"10.1145\/1835698.1835775"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J. Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 701\u2013712. Springer, Heidelberg (2011)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-35261-4_62","volume-title":"Algorithms and Computation","author":"A. Kawamura","year":"2012","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 598\u2013608. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09620-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T20:39:58Z","timestamp":1746304798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09620-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096193","9783319096209"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09620-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}