{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:43Z","timestamp":1760441443142},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720494"},{"type":"electronic","value":"9783319720500"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-72050-0_9","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T11:57:13Z","timestamp":1514548633000},"page":"140-157","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Wireless Evacuation on m Rays with k Searchers"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Richner","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-27848-8_106-2","volume-title":"Encyclopedia of Algorithms","author":"S Angelopoulos","year":"2016","unstructured":"Angelopoulos, S.: Deterministic searching on the line. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 531\u2013533. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-3-642-27848-8_106-2"},{"key":"9_CR2","first-page":"1","volume":"60","author":"S Angelopoulos","year":"2016","unstructured":"Angelopoulos, S., Ars\u00e9nio, D., D\u00fcrr, C., L\u00f3pez-Ortiz, A.: Multi-processor search and scheduling problems with setup cost. Theory Comput. Syst. 60, 1\u201334 (2016)","journal-title":"Theory Comput. Syst."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2014.03.028","volume":"540","author":"S Angelopoulos","year":"2014","unstructured":"Angelopoulos, S., L\u00f3pez-Ortiz, A., Panagiotou, K.: Multi-target ray searching problems. Theor. Comput. Sci. 540, 2\u201312 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR4","doi-asserted-by":"crossref","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(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"RA Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R.A., Schott, R.: Parallel searching in the plane. Comput. Geom. 5, 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"issue":"4","key":"9_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Israel J. Math. 2(4), 221\u2013228 (1964)","journal-title":"Israel J. Math."},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck, A., Newman, D.J.: Yet more on the linear search problem. Israel J. Math. 8(4), 419\u2013429 (1970)","journal-title":"Israel J. Math."},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search. SIAM Rev. 5(3), 274 (1963)","journal-title":"SIAM Rev."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-30139-6_12","volume-title":"WALCOM: Algorithms and Computation","author":"P Bose","year":"2016","unstructured":"Bose, P., De Carufel, J.-L.: A general framework for searching on a line. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 143\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30139-6_12"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.tcs.2014.12.007","volume":"569","author":"P Bose","year":"2015","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Searching on a line: a complete characterization of the optimal solution. Theoret. Comput. Sci. 569, 24\u201342 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-57586-5_10","volume-title":"Algorithms and Complexity","author":"S Brandt","year":"2017","unstructured":"Brandt, S., Laufenberg, F., Lv, Y., Stolz, D., Wattenhofer, R.: Collaboration without communication: evacuating two robots from a disk. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 104\u2013115. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_10"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Dobrev, S., Georgiou, K., Kranakis, E., MacQuarrie, F.: Evacuating two robots from multiple unknown exits in a circle. In: Proceedings of 17th International Conference on Distributed Computing and Networking, Singapore, 4\u20137 January 2016, pp. 28:1\u201328:8. ACM (2016)","DOI":"10.1145\/2833312.2833318"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-18173-8_10","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (extended abstract). In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 140\u2013152. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_10"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Godon, M., Kranakis, E., Godon, M., Krizanc, D., Rytter, W., Wlodarczyk, M.: Evacuation from a disc in the presence of a faulty robot. In: Proceedings of SIROCCO (2017)","DOI":"10.1007\/978-3-319-72050-0_10"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. In: Giakkoupis, G. (ed.) Proceedings of 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25\u201328 July 2016, pp. 405\u2013414. ACM (2016)","DOI":"10.1145\/2933057.2933102"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-19662-6_13","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 181\u2013194. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19662-6_13"},{"issue":"2\u20133","key":"9_CR19","doi-asserted-by":"crossref","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\u20133), 342\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2015.11.017","volume":"655","author":"K-T Foerster","year":"2016","unstructured":"Foerster, K.-T., Wattenhofer, R.: Lower and upper competitive bounds for online directed graph exploration. Theor. Comput. Sci. 655, 15\u201329 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/0127002","volume":"27","author":"S Gal","year":"1974","unstructured":"Gal, S.: Minimax solutions for linear search problems. SIAM J. Appl. Math. 27(1), 17\u201330 (1974)","journal-title":"SIAM J. Appl. Math."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-49116-3_12","volume-title":"STACS 1999","author":"M Hammar","year":"1999","unstructured":"Hammar, M., Nilsson, B.J., Schuierer, S.: Parallel searching on m rays. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 132\u2013142. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_12"},{"issue":"3","key":"9_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0925-7721(00)00028-6","volume":"18","author":"M Hammar","year":"2001","unstructured":"Hammar, M., Nilsson, B.J., Schuierer, S.: Parallel searching on m rays. Comput. Geom. 18(3), 125\u2013139 (2001)","journal-title":"Comput. Geom."},{"issue":"4","key":"9_CR24","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.49.4.501.11227","volume":"49","author":"P Jaillet","year":"2001","unstructured":"Jaillet, P., Stafford, M.: Online searching. Oper. Res. 49(4), 501\u2013515 (2001)","journal-title":"Oper. Res."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/11427186_51","volume-title":"Experimental and Efficient Algorithms","author":"T Kamphans","year":"2005","unstructured":"Kamphans, T., Langetepe, E.: Optimal competitive online ray search with an error-prone robot. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 593\u2013596. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11427186_51"},{"issue":"1","key":"9_CR26","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0959","volume":"29","author":"M-Y Kao","year":"1998","unstructured":"Kao, M.-Y., Ma, Y., Sipser, M., Yin, Y.L.: Optimal constructions of hybrid algorithms. J. Algorithms 29(1), 142\u2013164 (1998)","journal-title":"J. Algorithms"},{"issue":"1","key":"9_CR27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M-Y Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-25258-2_23","volume-title":"Structural Information and Communication Complexity","author":"D Komm","year":"2015","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Smula, J.: Treasure hunt with advice. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 328\u2013341. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_23"},{"issue":"2","key":"9_CR29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0304-3975(00)00144-4","volume":"261","author":"A L\u00f3pez-Ortiz","year":"2001","unstructured":"L\u00f3pez-Ortiz, A., Schuierer, S.: The ultimate strategy to search on m rays? Theoret. Comput. Sci. 261(2), 267\u2013295 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"9_CR30","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.tcs.2003.08.001","volume":"310","author":"A L\u00f3pez-Ortiz","year":"2004","unstructured":"L\u00f3pez-Ortiz, A., Schuierer, S.: On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. Theoret. Comput. Sci. 310(1\u20133), 527\u2013537 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-36477-3_20","volume-title":"Computer Science in Perspective","author":"S Schuierer","year":"2003","unstructured":"Schuierer, S.: A lower bound for randomized searching on m rays. In: Klein, R., Six, H.-W., Wegner, L. (eds.) Computer Science in Perspective. LNCS, vol. 2598, pp. 264\u2013277. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36477-3_20"},{"issue":"2","key":"9_CR32","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1007\/978-0-387-30162-4_328","volume-title":"Encyclopedia of Algorithms","author":"SR Tate","year":"2016","unstructured":"Tate, S.R.: Randomized searching on rays or the line. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1757\u20131759. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-0-387-30162-4_328"}],"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-72050-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:21:41Z","timestamp":1570555301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72050-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720494","9783319720500"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72050-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}