{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:11Z","timestamp":1747541051113,"version":"3.40.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"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-92932-8_16","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:20Z","timestamp":1747468040000},"page":"240-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Discrete and\u00a0Semi-continuous Versions of\u00a0the\u00a0Two-Watchtower Problem in\u00a0the\u00a0Plane"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8630-3835","authenticated-orcid":false,"given":"Leonidas","family":"Palios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s00453-008-9270-3","volume":"58","author":"PK Agarwal","year":"2010","unstructured":"Agarwal, P.K., et al.: Guarding a terrain by two watchtowers. Algorithmica 58(2), 352\u2013390 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9270-3","journal-title":"Algorithmica"},{"key":"16_CR2","unstructured":"Bahoo, Y., Bose, P., Durocher, S.: Watchtower for $$k$$-crossing visibility. In Friggstad, Z., De Carufel, J.-L. (eds.) 31st Canadian Conference on Computational Geometry (CCCG), pp.\u00a0203\u2013209 (2019)"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Moshe, B., Carmi, P., Katz., M.J.: Computing all large sums-of-pairs in $$\\mathbb{R}^n$$ and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3), 137\u2013139 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2003.07.008","DOI":"10.1016\/j.ipl.2003.07.008"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: A constant-factor approximation algorithm for optimal 1.5d terrain guarding. SIAM J. Comput. 36(6), 1631\u20131647 (2007). https:\/\/doi.org\/10.1137\/S0097539704446384","DOI":"10.1137\/S0097539704446384"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44679-6_14","volume-title":"Computing and Combinatorics","author":"S Bespamyatnikh","year":"2001","unstructured":"Bespamyatnikh, S., Chen, Z., Wang, K., Zhu, B.: On the planar two-watchtower problem. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 121\u2013130. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44679-6_14"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2006","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Discret. Comput. Geom. 37(1), 43\u201358 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1273-8","journal-title":"Discret. Comput. Geom."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2. ISBN 978-3-540-77973-5","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Computing the extreme distances between two convex polygons. J. Algorithms 6(2), 213\u2013224 (1985). https:\/\/doi.org\/10.1016\/0196-6774(85)90039-2","journal-title":"J. Algorithms"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Friedrichs, S., Hemmer, M., King, J., Schmidt, C.: The continuous 1.5d terrain guarding problem: discretization, optimal solutions, and PTAS. J. Comput. Geom. 7(1), 256\u2013284 (2016). https:\/\/doi.org\/10.20382\/jocg.v7i1a13","DOI":"10.20382\/jocg.v7i1a13"},{"key":"16_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-14070-0_77","volume-title":"16th International Conference on Information Technology-New Generations (ITNG 2019)","author":"L Gewali","year":"2019","unstructured":"Gewali, L., Dahal, B.: Algorithms for tower placement on terrain. In: Latifi, S. (ed.) 16th International Conference on Information Technology-New Generations (ITNG 2019). AISC, vol. 800, pp. 551\u2013556. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14070-0_77"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. Mathematical Surveys and Monographs, vol.\u00a0173, pp.\u00a0362. American Mathematical Society (2011)","DOI":"10.1090\/surv\/173"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Khodakarami, F., Didehvar, F., Mohades, A.: 1.5d terrain guarding problem parameterized by guard range. Theor. Comput. Sci. 661, 65\u201369 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.11.015","DOI":"10.1016\/j.tcs.2016.11.015"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/11682462_58","volume-title":"LATIN 2006: Theoretical Informatics","author":"J King","year":"2006","unstructured":"King, J.: A 4-approximation algorithm for guarding 1.5-dimensional terrains. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 629\u2013640. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_58"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"J King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011). https:\/\/doi.org\/10.1137\/100791506","journal-title":"SIAM J. Comput."},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101918","volume":"109","author":"R Seth","year":"2023","unstructured":"Seth, R., Maheshwari, A., Nandy, S.C.: Acrophobic guard watchtower problem. Comput. Geom. 109, 101918 (2023). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101918","journal-title":"Comput. Geom."},{"issue":"5","key":"16_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0020-0190(88)90120-2","volume":"29","author":"M Sharir","year":"1988","unstructured":"Sharir, M.: The shortest watchtower and related problems for polyhedral terrains. Inf. Process. Lett. 29(5), 265\u2013270 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90120-2","journal-title":"Inf. Process. Lett."},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-78455-7_9","volume-title":"Frontiers in Algorithmics","author":"N Tripathi","year":"2018","unstructured":"Tripathi, N., Pal, M., De, M., Das, G., Nandy, S.C.: Guarding polyhedral terrain by k-watchtowers. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 112\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_9"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp.\u00a0973\u20131027. North Holland (2000). https:\/\/doi.org\/10.1016\/B978-044482537-7\/50023-1","DOI":"10.1016\/B978-044482537-7\/50023-1"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0925-7721(96)00009-0","volume":"8","author":"B Zhu","year":"1997","unstructured":"Zhu, B.: Computing the shortest watchtower of a polyhedral terrain in $$O(n \\log n)$$ time. Comput. Geom. 8, 181\u2013193 (1997). https:\/\/doi.org\/10.1016\/S0925-7721(96)00009-0","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:22Z","timestamp":1747468042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}