{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:40:01Z","timestamp":1725997201143},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_9","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"126-138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Searching with Increasing Speeds"],"prefix":"10.1007","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Min","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-03456-5_17","volume-title":"Efficient Algorithms","author":"T Asano","year":"2009","unstructured":"Asano, T., Bereg, S., Kirkpatrick, D.: Finding nearest larger neighbors. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 249\u2013260. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03456-5_17"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-19487-8_20","volume-title":"SWAT 88","author":"RA Baeza-Yates","year":"1988","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching with uncertainty extended abstract. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 176\u2013189. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19487-8_20"},{"issue":"2","key":"9_CR3","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(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","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. Theory Appl. 5(3), 143\u2013154 (1995)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-48314-6_13","volume-title":"Structural Information and Communication Complexity","author":"E Bampas","year":"2016","unstructured":"Bampas, E., et al.: Linear search by a pair of distinct-speed robots. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 195\u2013211. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_13"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10021-9","volume":"62","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Minimization problem. Bull. AMS 62(3), 270 (1956)","journal-title":"Bull. AMS"},{"doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: exploring and mapping directed graphs. In: STOC 1998, pp. 269\u2013278 (1998)","key":"9_CR7","DOI":"10.1145\/276698.276759"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-40450-4_18","volume-title":"Algorithms \u2013 ESA 2013","author":"P Bose","year":"2013","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Revisiting the problem of searching on a line. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 205\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_18"},{"key":"9_CR9","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_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2015.09.011","volume":"608","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Georgiou, K., Kranakis, E., MacQuarrie, F.: The beachcombers\u2019 problem: walking and searching with mobile robots. Theor. Comput. Sci. 608, 201\u2013218 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR11","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). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_59"},{"doi-asserted-by":"crossref","unstructured":"Devillers, O.: Improved incremental randomized Delaunay triangulation. In: Symposium on Computational Geometry, pp. 106\u2013115 (1998)","key":"9_CR12","DOI":"10.1145\/276884.276896"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cosrev.2010.05.001","volume":"4","author":"SK Ghosh","year":"2010","unstructured":"Ghosh, S.K., Klein, R.: Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4(4), 189\u2013201 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/3-540-45749-6_52","volume-title":"Algorithms \u2014 ESA 2002","author":"MI Karavelas","year":"2002","unstructured":"Karavelas, M.I., Yvinec, M.: Dynamic additively weighted Voronoi diagrams in 2D. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 586\u2013598. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_52"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","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":"11","key":"9_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"131","author":"A Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opusza\u0144ski, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 131(11), 543\u2013547 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"109","author":"MY 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. 109(1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-014-0226-3","volume":"28","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. Distrib. Comput. 28(2), 147\u2013154 (2015)","journal-title":"Distrib. Comput."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-61440-0_135","volume-title":"Automata, Languages and Programming","author":"E Koutsoupias","year":"1996","unstructured":"Koutsoupias, E., Papadimitriou, C., Yannakakis, M.: Searching a fixed graph. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 280\u2013289. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_135"},{"unstructured":"Li, H., Chong, K.P.: Search on lines and graphs. In: Proceedings of 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference (CDC\/CCC 2009), vol. 109, no. 11, pp. 5780\u20135785 (2009)","key":"9_CR22"},{"unstructured":"Shortt, D.: Gravity assist, 27 September 2013. www.planetary.org","key":"9_CR23"},{"doi-asserted-by":"crossref","unstructured":"Temple, T., Frazzoli, E.: Whittle-indexability of the cow path problem. In: American Control Conference (ACC), pp. 4152\u20134158 (2010)","key":"9_CR24","DOI":"10.1109\/ACC.2010.5530603"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T03:42:29Z","timestamp":1572147749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}