{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:48:46Z","timestamp":1742917726826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030900472"},{"type":"electronic","value":"9783030900489"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90048-9_3","type":"book-chapter","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T16:03:44Z","timestamp":1635437024000},"page":"28-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Negative Instance for the Edge Patrolling Beacon Problem"],"prefix":"10.1007","author":[{"given":"Zachary","family":"Abel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo A.","family":"Akitaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Hesterberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason S.","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,29]]},"reference":[{"key":"3_CR1","unstructured":"Biro, M.: Beacon-based routing and guarding. Ph.D. thesis, Stony Brook University, May 2013"},{"key":"3_CR2","unstructured":"Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.: Beacon-based routing and coverage. In: Abstracts from the 21st Fall Workshop on Computational Geometry (2011)"},{"key":"3_CR3","unstructured":"Biro, M., Gao, J., Iwerks, J., Kostitsyna, I., Mitchell, J.S.: Combinatorics of beacon routing and coverage. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Canada, August 2013"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-40104-6_14","volume-title":"Algorithms and Data Structures","author":"M Biro","year":"2013","unstructured":"Biro, M., Iwerks, J., Kostitsyna, I., Mitchell, J.S.B.: Beacon-based algorithms for geometric routing. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 158\u2013169. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_14"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-319-77404-6_26","volume-title":"LATIN 2018: Theoretical Informatics","author":"J Cleve","year":"2018","unstructured":"Cleve, J., Mulzer, W.: Combinatorics of beacon-based routing in three dimensions. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 346\u2013360. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_26"},{"key":"3_CR6","unstructured":"Kostitsyna, I., Kouhestani, B., Langerman, S., Rappaport, D.: An optimal algorithm to compute the inverse beacon attraction region. In: Speckmann, B., T\u00f3th, C.D. (eds.) Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), volume 99 of LIPIcs, pp. 55:1\u201355:14, Budapest, Hungary, June 2018"},{"key":"3_CR7","unstructured":"Kouhestani, B.: Efficient algorithms for beacon routing in polygons. Ph.D. thesis, Queen\u2019s University, Kingston, Canada (2017)"},{"key":"3_CR8","unstructured":"Kouhestani, B., Rappaport, D.: Edge patrolling beacon. In: Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, pp. 101\u2013102 (2017)"},{"key":"3_CR9","unstructured":"Rappaport, D.: Personal communication held after the presentation of [8] (2017)"},{"key":"3_CR10","unstructured":"Shermer, T.C.: A combinatorial bound for beacon-based routing in orthogonal polygons. In: Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Ontario, pp. 213\u2013219 (2015)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90048-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T16:04:12Z","timestamp":1635437052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90048-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030900472","9783030900489"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90048-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quezon City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philippines","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ateneo.edu\/ls\/sose\/mathematics\/jcdcggg2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}