{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:15:17Z","timestamp":1743012917007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031813955"},{"type":"electronic","value":"9783031813962"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81396-2_3","type":"book-chapter","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T21:14:09Z","timestamp":1739394849000},"page":"31-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Searching in\u00a0Euclidean Spaces with\u00a0Predictions"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Giannopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science, vol.\u00a055. Kluwer (2003). https:\/\/doi.org\/10.1007\/b100809","DOI":"10.1007\/b100809"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Angelopoulos, S.: Online search with a hint. In: Lee, J.R. (ed.) 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, 6\u20138 January 2021, Virtual Conference. LIPIcs, vol.\u00a0185, pp. 51:1\u201351:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2021.51","DOI":"10.4230\/LIPICS.ITCS.2021.51"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Angelopoulos, S.: Competitive search in the line and the star with predictions. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. LIPIcs, 28 August\u20131 September 2023, Bordeaux, France, vol.\u00a0272, pp. 12:1\u201312:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2023.12","DOI":"10.4230\/LIPICS.MFCS.2023.12"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baezayates","year":"1993","unstructured":"Baezayates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1054","journal-title":"Inf. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Banerjee, S., Cohen-Addad, V., Gupta, A., Li, Z.: Graph searching with predictions. In: Kalai, Y.T. (ed.) 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, 10\u201313 January 2023, MIT, Cambridge, Massachusetts, USA. LIPIcs, vol.\u00a0251, pp. 12:1\u201312:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2023.12","DOI":"10.4230\/LIPICS.ITCS.2023.12"},{"key":"3_CR6","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 J. Math. 2, 221\u2013228 (1964). https:\/\/doi.org\/10.1007\/BF02759737","journal-title":"Israel J. Math."},{"key":"3_CR7","doi-asserted-by":"publisher","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, 419\u2013429 (1970). https:\/\/doi.org\/10.1007\/BF02798690","journal-title":"Israel J. Math."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10026-8","volume":"62","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Minimization problem. Bull. Amer. Math. Soc. 62, 270 (1956)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: Problem 63-9, an optimal search. SIAM Rev. 5(3), 274\u2013274 (1963)","journal-title":"SIAM Rev."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/J.TCS.2014.12.007","volume":"569","author":"P Bose","year":"2015","unstructured":"Bose, P., Carufel, J.D., Durocher, S.: Searching on a line: a complete characterization of the optimal solution. Theor. Comput. Sci. 569, 24\u201342 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2014.12.007","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: The traveling salesman problem for lines, balls, and planes. ACM Trans. Algorithms 12(3), 43:1\u201343:29 (2016). https:\/\/doi.org\/10.1145\/2850418","DOI":"10.1145\/2850418"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0218195909002897","volume":"19","author":"KM Elbassioni","year":"2009","unstructured":"Elbassioni, K.M., Fishkin, A.V., Sitters, R.: Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods. Int. J. Comput. Geom. Appl. 19(2), 173\u2013193 (2009). https:\/\/doi.org\/10.1142\/S0218195909002897","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1112\/S0025579300000784","volume":"2","author":"L Few","year":"1955","unstructured":"Few, L.: The shortest path and the shortest road through $$n$$ points. Mathematika 2(2), 141\u2013144 (1955). https:\/\/doi.org\/10.1112\/S0025579300000784","journal-title":"Mathematika"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BF02764811","volume":"12","author":"S Gal","year":"1972","unstructured":"Gal, S.: A general search game. Israel J. Math. 12, 32\u201345 (1972)","journal-title":"Israel J. Math."},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","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":"3_CR16","unstructured":"Gal, S.: Search Games. Academic Press, New York (1980)"},{"issue":"4","key":"3_CR17","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). https:\/\/doi.org\/10.1016\/J.COSREV.2010.05.001","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006). https:\/\/doi.org\/10.1137\/S0097539704446281","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(99)00009-8","volume":"93","author":"CA Hipke","year":"1999","unstructured":"Hipke, C.A., Icking, C., Klein, R., Langetepe, E.: How to find a point on a line within a fixed distance. Discret. Appl. Math. 93(1), 67\u201373 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(99)00009-8","journal-title":"Discret. Appl. Math."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800040409","volume":"4","author":"JR Isbell","year":"1957","unstructured":"Isbell, J.R.: An optimal search pattern. Nav. Res. Logist. Q. 4, 357\u2013359 (1957)","journal-title":"Nav. Res. Logist. Q."},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Klein, R.: Algorithmische Geometrie, 2nd edn. Springer-Verlag, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27619-X","DOI":"10.1007\/3-540-27619-X"},{"issue":"4","key":"3_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/S00446-019-00358-Y","volume":"34","author":"A Kupavskii","year":"2021","unstructured":"Kupavskii, A., Welzl, E.: Lower bounds for searching robots, some faulty. Distrib. Comput. 34(4), 229\u2013237 (2021). https:\/\/doi.org\/10.1007\/S00446-019-00358-Y","journal-title":"Distrib. Comput."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Langetepe, E.: On the optimality of spiral search. In: Charikar, M. (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17\u201319 January 2010, pp. 1\u201312. SIAM (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.1","DOI":"10.1137\/1.9781611973075.1"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","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? Theor. Comput. Sci. 261(2), 267\u2013295 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00144-4","journal-title":"Theor. Comput. Sci."},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with predictions. In: Roughgarden, T. (ed.) Beyond the Worst-Case Analysis of Algorithms, pp. 646\u2013662. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108637435.037","DOI":"10.1017\/9781108637435.037"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Schuierer, S.: On-line searching in simple polygons. In: Christensen, H.I., Bunke, H., Noltemeier, H. (eds.) Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, 28 September\u20132 October 1998, Selected Papers. LNCS, vol.\u00a01724, pp. 220\u2013239. Springer (1998). https:\/\/doi.org\/10.1007\/10705474_12","DOI":"10.1007\/10705474_12"},{"issue":"742","key":"3_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1515\/crelle-2015-0098","volume":"2018","author":"RC Vaughan","year":"2018","unstructured":"Vaughan, R.C., Wooley, T.D.: The asymptotic formula in Waring\u2019s problem: higher order expansions. J. f\u00fcr die reine und angewandte Mathematik (Crelles J.) 2018(742), 17\u201346 (2018). https:\/\/doi.org\/10.1515\/crelle-2015-0098","journal-title":"J. f\u00fcr die reine und angewandte Mathematik (Crelles J.)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81396-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T21:14:13Z","timestamp":1739394853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81396-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813955","9783031813962"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81396-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}