{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:11:13Z","timestamp":1757311873484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_3","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"28-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted Group Search on\u00a0the\u00a0Disk and Improved LP-Based Lower Bounds for\u00a0Priority Evacuation"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6825-7","volume-title":"Search Theory: A Game Theoretic Perspective","author":"S Alpern","year":"2013","unstructured":"Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R., Subrahmanian, V.: Search Theory: A Game Theoretic Perspective. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7"},{"key":"3_CR2","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)"},{"key":"3_CR3","unstructured":"Angelopoulos, S., D\u00fcrr, C., Jin, S.: Best-of-two-worlds analysis of online search. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, 13\u201316 March 2019, Berlin, Germany. LIPIcs, vol. 126, pp. 7:1\u20137:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2019.01.039","volume":"260","author":"S Angelopoulos","year":"2019","unstructured":"Angelopoulos, S., D\u00fcrr, C., Lidbetter, T.: The expanding search ratio of a graph. Discret. Appl. Math. 260, 51\u201365 (2019)","journal-title":"Discret. Appl. Math."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","DOI":"10.1006\/inco.1993.1054"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00453-018-0447-0","volume":"81","author":"E Bampas","year":"2019","unstructured":"Bampas, E., et al.: Linear search by a pair of distinct-speed robots. Algorithmica 81(1), 317\u2013342 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR7","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(4), 221\u2013228 (1964)","journal-title":"Israel J. Math."},{"key":"3_CR8","first-page":"1","volume":"85","author":"A Bonato","year":"2022","unstructured":"Bonato, A., Georgiou, K., MacRury, C., Pra\u0142at, P.: Algorithms for p-faulty search on a half-line. Algorithmica 85, 1\u201330 (2022)","journal-title":"Algorithmica"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-48314-6_15","volume-title":"Structural Information and Communication Complexity","author":"P Borowiecki","year":"2016","unstructured":"Borowiecki, P., Das, S., Dereniowski, D., Kuszner, \u0141: Distributed evacuation in graphs with multiple exits. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 228\u2013241. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_15"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2018.10.032","volume":"811","author":"S Brandt","year":"2020","unstructured":"Brandt, S., Foerster, K.-T., Richner, B., Wattenhofer, R.: Wireless evacuation on m rays with k searchers. Theor. Comput. Sci. 811, 56\u201369 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","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"},{"issue":"11","key":"3_CR12","doi-asserted-by":"publisher","first-page":"506","DOI":"10.3390\/info11110506","volume":"11","author":"H Chuangpishit","year":"2020","unstructured":"Chuangpishit, H., Georgiou, K., Sharma, P.: A multi-objective optimization problem on evacuating 2 robots from the disk in the face-to-face model; trade-offs between worst-case and average-case analysis. Information 11(11), 506 (2020)","journal-title":"Information"},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101624","volume":"89","author":"H Chuangpishit","year":"2020","unstructured":"Chuangpishit, H., Mehrabi, S., Narayanan, L., Opatrny, J.: Evacuating equilateral triangles and squares in the face-to-face model. Comput. Geom. 89, 101624 (2020)","journal-title":"Comput. Geom."},{"key":"3_CR14","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: ICDCN, pp. 28:1\u201328:8. ACM (2016)","DOI":"10.1145\/2833312.2833318"},{"key":"3_CR15","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":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-72050-0_10","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., et al.: Evacuation from a disc in the presence of\u00a0a\u00a0faulty robot. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 158\u2013173. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72050-0_10"},{"key":"3_CR17","unstructured":"Czyzowicz, J., et al.: Energy consumption of group search on a line. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 132, pp. 137:1\u2013137:15, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2020.11.014","volume":"852","author":"J Czyzowicz","year":"2021","unstructured":"Czyzowicz, J., et al.: Time-energy tradeoffs for evacuation by two robots in the wireless model. Theoret. Comput. Sci. 852, 61\u201372 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.tcs.2019.09.026","volume":"806","author":"J Czyzowicz","year":"2020","unstructured":"Czyzowicz, J., et al.: Priority evacuation from a disk: the case of n= 1, 2, 3. Theoret. Comput. Sci. 806, 595\u2013616 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2020.09.023","volume":"846","author":"J Czyzowicz","year":"2020","unstructured":"Czyzowicz, J., et al.: Priority evacuation from a disk: The case of $$n\\ge 4$$. Theoret. Comput. Sci. 846, 91\u2013102 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-11072-7_14","volume-title":"Distributed Computing by Mobile Entities","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 335\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_14"},{"issue":"04","key":"3_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1142\/S0129054121500209","volume":"32","author":"J Czyzowicz","year":"2021","unstructured":"Czyzowicz, J., et al.: Search on a line by byzantine robots. Int. J. Found. Comput. Sci. 32(04), 369\u2013387 (2021)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR23","unstructured":"Czyzowicz, J., et al.: Group evacuation on a line by agents with different communication abilities. In: ISAAC 2021, pp. 57:1\u201357:24 (2021)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Killick, R., Kranakis, E., Stachowiak, G.: Search and evacuation with a near majority of faulty agents. In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA 2021), pp. 217\u2013227. SIAM (2021)","DOI":"10.1137\/1.9781611976830.20"},{"issue":"6","key":"3_CR25","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00446-017-0296-0","volume":"32","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. Distrib. Comput. 32(6), 493\u2013504 (2019)","journal-title":"Distrib. Comput."},{"key":"3_CR26","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"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-24922-9_14","volume-title":"Structural Information and Communication Complexity","author":"Y Disser","year":"2019","unstructured":"Disser, Y., Schmitt, S.: Evacuating two robots from a disk: a second cut. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 200\u2013214. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_14"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00446-016-0285-8","volume":"30","author":"O Feinerman","year":"2017","unstructured":"Feinerman, O., Korman, A.: The ants problem. Distrib. Comput. 30(3), 149\u2013168 (2017)","journal-title":"Distrib. Comput."},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17458-2_3","volume-title":"Combinatorial Optimization and Applications","author":"S Fekete","year":"2010","unstructured":"Fekete, S., Gray, C., Kr\u00f6ller, A.: Evacuation of rectilinear polygons. In: Wu, W., Daescu, O. (eds.) COCOA 2010. LNCS, vol. 6508, pp. 21\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17458-2_3"},{"key":"3_CR30","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7","volume-title":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing","year":"2019","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7"},{"key":"3_CR31","unstructured":"Georgiou, K., Giachoudis, N., Kranakis, E.: Evacuation from a disk for robots with asymmetric communication. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"3_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-031-22050-0_6","volume-title":"Algorithmics of Wireless Networks","author":"K Georgiou","year":"2022","unstructured":"Georgiou, K., Jang, W.: Triangle evacuation of 2 agents in the wireless model. In: Erlebach, T., Segal, M. (eds.) ALGOSENSORS 2022. LNCS, vol. 13707, pp. 77\u201390. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22050-0_6"},{"key":"3_CR33","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E.: Search-and-fetch with 2 robots on a disk: wireless and face-to-face communication models. Discrete Math. Theor. Comput. Sci. 21 (2019)"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-34405-4_11","volume-title":"Algorithms for Sensor Systems","author":"K Georgiou","year":"2019","unstructured":"Georgiou, K., Kranakis, E., Leonardos, N., Pagourtzis, A., Papaioannou, I.: Optimal circle search despite the presence of faulty robots. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 192\u2013205. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34405-4_11"},{"key":"3_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.025","volume":"944","author":"K Georgiou","year":"2023","unstructured":"Georgiou, K., Leizerovich, S., Lucier, J., Kundu, S.: Evacuating from $$\\ell _p$$ unit disks in the wireless model. Theoret. Comput. Sci. 944, 113675 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.10.013","volume":"939","author":"K Georgiou","year":"2023","unstructured":"Georgiou, K., Lucier, J.: Weighted group search on a line & implications to the priority evacuation problem. Theoret. Comput. Sci. 939, 1\u201317 (2023)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR37","first-page":"1","volume":"59","author":"R Hohzaki","year":"2016","unstructured":"Hohzaki, R.: Search games: literature and survey. J. Oper. Res. Soc. Japan 59(1), 1\u201334 (2016)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jpdc.2015.06.004","volume":"83","author":"A Miller","year":"2015","unstructured":"Miller, A., Pelc, A.: Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distributed Comput. 83, 159\u2013167 (2015)","journal-title":"J. Parallel Distributed Comput."},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-41672-0_9","volume-title":"Complexity and Approximation","author":"X Sun","year":"2020","unstructured":"Sun, X., Sun, Y., Zhang, J.: Better upper bounds for searching on a line with byzantine robots. In: Du, D.-Z., Wang, J. (eds.) Complexity and Approximation. LNCS, vol. 12000, pp. 151\u2013171. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_9"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:06:38Z","timestamp":1718975198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}