{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T22:10:10Z","timestamp":1747347010778,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460177"},{"type":"electronic","value":"9783662460184"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46018-4_1","type":"book-chapter","created":{"date-parts":[[2015,1,3]],"date-time":"2015-01-03T14:51:00Z","timestamp":1420296660000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Multi-source Beachcombers\u2019 Problem"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fraser","family":"MacQuarrie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,4]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Gasieniec, 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":"1_CR2","unstructured":"Koopman, B.O.: Search and screening. Operations Evaluation Group,Office of the Chief of Naval Operations, Navy Department (1946)"},{"key":"1_CR3","volume-title":"Theory of Optimal Search","author":"LD Stone","year":"1975","unstructured":"Stone, L.D.: Theory of Optimal Search. Academic Press, New York (1975)"},{"key":"1_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, vol. 55. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1_CR5","unstructured":"Shannon, C.E.: Presentation of a maze-solving machine. In: 8th Conference of the Josiah Macy Jr. Found (Cybernetics), pp. 173\u2013180 (1951)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Korman, A., Lotker, Z., Sereni, J.S.: Collaborative search on the plane without communication. In: PODC, pp. 77\u201386. ACM (2012)","DOI":"10.1145\/2332432.2332444"},{"key":"1_CR7","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":"1_CR8","unstructured":"Kao, M.Y., Littman, M.L.: Algorithms for informed cows. In: AAAI-97 Workshop on On-line Search (1997)"},{"key":"1_CR9","unstructured":"Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. In: SODA, pp. 441\u2013447. Society for Industrial and Applied Mathematics (1993)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Fiat, A., Foster, D.P., Karloff, H., Rabani, Y., Ravid, Y., Viswanathan, S.: Competitive algorithms for layered graph traversal. In: FOCS, pp. 288\u2013297. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185381"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theor. Comput. Sci. 84(1), 127\u2013150 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-22300-6_4","volume-title":"Algorithms and Data Structures","author":"S Angelopoulos","year":"2011","unstructured":"Angelopoulos, S., L\u00f3pez-Ortiz, A., Panagiotou, K.: Multi-target ray searching problems. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 37\u201348. Springer, Heidelberg (2011)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Burman, J., Clement, J., Kutten, S.: On utilizing speed in networks of mobile agents. In: PODC, pp. 305\u2013314. ACM (2010)","DOI":"10.1145\/1835698.1835775"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, J.A., Kovalyov, M., Potts, C., Tautenhahn, T., Velde, S.: Scheduling a batching machine. J. Sched. 1(1), 31\u201354 (1998)","journal-title":"J. Sched."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C Potts","year":"2000","unstructured":"Potts, C., Kovalyov, M.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32(7), 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.39.1.130","volume":"39","author":"S Anily","year":"1991","unstructured":"Anily, S., Federgruen, A.: Structured partitioning problems. Oper. Res. 39(1), 130\u2013149 (1991)","journal-title":"Oper. Res."},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1287\/opre.33.4.820","volume":"33","author":"AK Chakravarty","year":"1985","unstructured":"Chakravarty, A.K., Orlin, J.B., Rothblum, U.G.: Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishment. Oper. Res. 33(4), 820\u2013834 (1985)","journal-title":"Oper. Res."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1287\/opre.30.5.1018","volume":"30","author":"AK Chakravarty","year":"1985","unstructured":"Chakravarty, A.K., Orlin, J.B., Rothblum, V.G.: A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. Oper. Res. 30, 1018\u20131020 (1985)","journal-title":"Oper. Res."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA, pp. 1064\u20131073. ACM Press (2006)","DOI":"10.1145\/1109557.1109675"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.4086\/toc.2010.v006a011","volume":"6","author":"U Feige","year":"2010","unstructured":"Feige, U., Vondr\u00e1k, J.: The submodular welfare problem with demand queries. Theory Comput. 6(1), 247\u2013290 (2010)","journal-title":"Theory Comput."},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.ejor.2010.05.034","volume":"207","author":"CT Ng","year":"2010","unstructured":"Ng, C.T., Barketau, M.S., Cheng, T.C.E., Kovalyov, M.Y.: \u201cProduct partition\u201d and related problems of scheduling and systems reliability: computational complexity and approximation. Eur. J. Oper. Res. 207(2), 601\u2013604 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46018-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T21:40:38Z","timestamp":1747345238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46018-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460177","9783662460184"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46018-4_1","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":"4 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}