{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:24:06Z","timestamp":1725600246080},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_4","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"37-48","source":"Crossref","is-referenced-by-count":1,"title":["Multi-target Ray Searching Problems"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Panagiotou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Information and Computation\u00a0106, 234\u2013244 (1993)","journal-title":"Information and Computation"},{"key":"4_CR2","first-page":"221","volume":"2","author":"A. Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Naval Research Logistics\u00a02, 221\u2013228 (1964)","journal-title":"Naval Research Logistics"},{"key":"4_CR3","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. of Math.\u00a08, 419\u2013429 (1970)","journal-title":"Israel J. of Math."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R. Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search problem. SIAM Review\u00a05, 274 (1963)","journal-title":"SIAM Review"},{"key":"4_CR5","unstructured":"Bernstein, D.S., Finkelstein, L., Zilberstein, S.: Contract algorithms and robots on rays: unifying two scheduling problems. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1211\u20131217 (2003)"},{"key":"4_CR6","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, 342\u2013355 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"4_CR7","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 Journal on Computing\u00a038(3), 881\u2013898 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR8","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. on Applied Math.\u00a027, 17\u201330 (1974)","journal-title":"SIAM J. on Applied Math."},{"issue":"1-2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"4_CR10","first-page":"234","volume":"49","author":"P. Jaillet","year":"1993","unstructured":"Jaillet, P., Stafford, M.: Online searching. Opes. Res.\u00a049, 234\u2013244 (1993)","journal-title":"Opes. Res."},{"key":"4_CR11","unstructured":"Kao, M.-Y., Littman, M.L.: Algorithms for informed cows. In: Proceedings of the AAAI 1997 Workshop on Online Search (1997)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a029(1), 142\u2013164 (1998)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","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. Information and Computation\u00a0131(1), 63\u201380 (1996)","journal-title":"Information and Computation"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-642-04128-0_46","volume-title":"Algorithms - ESA 2009","author":"D. Kirkpatrick","year":"2009","unstructured":"Kirkpatrick, D.: Hyperbolic dovetailing. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 516\u2013527. Springer, Heidelberg (2009)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H., Yannakakis, M.: Searching a fixed graph. In: Proc. of the 23rd Int. Colloq. on Automata, Languages and Programming (ICALP), pp. 280\u2013289 (1996)","DOI":"10.1007\/3-540-61440-0_135"},{"issue":"2","key":"4_CR16","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. Theoretical Computer Science\u00a0261(2), 267\u2013295 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"4_CR17","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0310(1-3), 527\u2013537 (2004)","journal-title":"Theoretical Computer Science"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-04128-0_45","volume-title":"Algorithms - ESA 2009","author":"A. McGregor","year":"2009","unstructured":"McGregor, A., Onak, K., Panigrahy, R.: The oil searching problem. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 504\u2013515. Springer, Heidelberg (2009)"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0925-7721(00)00030-4","volume":"18","author":"S. Schuierer","year":"2001","unstructured":"Schuierer, S.: Lower bounds in online geometric searching. Computational Geometry: Theory and Applications\u00a018(1), 37\u201353 (2001)","journal-title":"Computational Geometry: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T07:09:40Z","timestamp":1554016180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}