{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:40:02Z","timestamp":1748738402186,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319284712"},{"type":"electronic","value":"9783319284729"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28472-9_12","type":"book-chapter","created":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T11:22:47Z","timestamp":1451560967000},"page":"155-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Beachcombing on Strips and Islands"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,1]]},"reference":[{"issue":"4","key":"12_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 J. Comput. 29(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"12_CR2","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. 97(1\u20132), 3\u201326 (2003)","journal-title":"Math. Program."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-15328-0_37","volume-title":"Algorithms Unplugged","author":"S Albers","year":"2011","unstructured":"Albers, S., Schmelzer, S.: Online algorithms - what is it worth to know the future? In: V\u00f6cking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., Wagner, D. (eds.) Algorithms Unplugged, pp. 361\u2013366. Springer, Heidelberg (2011)"},{"key":"12_CR4","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Dordrecht (2002). vol. 55"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inf. Comput. 106, 234\u2013234 (1993)","journal-title":"Inf. Comput."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Burman, J., Clement, J., Kutten, S.: On utilizing speed in networks of mobile agents. In: ACM SIGACT-SIGOPS 2010, pp. 305\u2013314. ACM (2010)","DOI":"10.1145\/1835698.1835775"},{"issue":"4","key":"12_CR7","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. Isr. J. Math. 2(4), 221\u2013228 (1964)","journal-title":"Isr. J. Math."},{"key":"12_CR8","first-page":"270","volume":"62","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search problem. Bull. Am. Math. Soc. 62, 270 (1963)","journal-title":"Bull. Am. Math. Soc."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0029571","volume-title":"Online Algorithms - The State of the Art","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. 1442, pp. 232\u2013241. Springer, Heidelberg (1998)"},{"key":"12_CR10","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. 6410, pp. 208\u2013219. Springer, Heidelberg (2010)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-09620-9_4","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Georgiou, K., Kranakis, E., MacQuarrie, F.: The Beachcombers\u2019 problem: walking and searching with mobile robots. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 23\u201336. Springer, Heidelberg (2014)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-662-46018-4_1","volume-title":"Algorithms for Sensor Systems","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Gasieniec, L., Georgiou, K., Kranakis, E., MacQuarrie, F.: The multi-source Beachcombers problem. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014, LNCS 8847. LNCS, vol. 8847, pp. 3\u201321. Springer, Heidelberg (2015)"},{"key":"12_CR13","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. 6942, pp. 701\u2013712. Springer, Heidelberg (2011)"},{"key":"12_CR14","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. 225, 16\u201328 (2013)","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"12_CR15","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. 385(1\u20133), 34\u201348 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361(2), 342\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. In: Foundations of Computer Science, FOCS 1990, pp. 355\u2013361. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89554"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.H.: How to learn an unknown environment (extended abstract). In: Foundations of Computer Science, FOCS 1991, pp. 298\u2013303. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185382"},{"key":"12_CR19","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. 7966, pp. 520\u2013532. Springer, Heidelberg (2013)"},{"issue":"3","key":"12_CR20","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. 38(3), 881\u2013898 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR22","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 48(3), 166\u2013177 (2006)","journal-title":"Networks"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s10878-012-9571-y","volume":"28","author":"Y Higashikawa","year":"2012","unstructured":"Higashikawa, Y., Katoh, N., Langerman, S., Tanigawa, S.: Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28, 480\u2013495 (2012)","journal-title":"J. Comb. Optim."},{"key":"12_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., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 598\u2013608. Springer, Heidelberg (2012)"},{"issue":"4","key":"12_CR25","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 Trans. Sens. Netw. 7(4), 33 (2011)","journal-title":"ACM Trans. Sens. Netw."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28472-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:59:13Z","timestamp":1748735953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28472-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319284712","9783319284729"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28472-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}