{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:30:47Z","timestamp":1743107447976,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030808785"},{"type":"electronic","value":"9783030808792"}],"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-80879-2_6","type":"book-chapter","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T08:10:56Z","timestamp":1625472656000},"page":"81-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon"],"prefix":"10.1007","author":[{"given":"Stav","family":"Ashur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omrit","family":"Filtser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists $$$$\\mathbb{R}$$-complete. In: Proceedings of the 50th ACM SIGACT Sympos. on Theory of Computing, STOC, pp. 65\u201373 (2018)","DOI":"10.1145\/3188745.3188868"},{"key":"6_CR2","unstructured":"Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, Johns Hopkins University (1984)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Ashur, S., Filtser, O., Katz, M.J., Saban, R.: Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms, WAOA, pp. 1\u201317 (2019)","DOI":"10.1007\/978-3-030-39479-0_1"},{"issue":"12","key":"6_CR4","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. 30(12), 910\u2013914 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR5","unstructured":"Bhattacharya, P., Ghosh, S.K., Pal, S.: Constant approximation algorithms for guarding simple polygons using vertex guards. arXiv:1712.05492 (2017)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dam.2016.12.015","volume":"228","author":"P Bhattacharya","year":"2017","unstructured":"Bhattacharya, P., Ghosh, S.K., Roy, B.: Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228, 109\u2013129 (2017)","journal-title":"Discret. Appl. Math."},{"key":"6_CR7","unstructured":"Bhattacharya, P., Ghosh, S.K., Roy, B.: Personal communication (2018)"},{"key":"6_CR8","unstructured":"Bonnet, \u00c9., Miltzow, T.: An approximation algorithm for the art gallery problem. In: Proceedings of the 33rd International Symposium on Computational Geometry, SoCG, pp. 20:1\u201320:15 (2017)"},{"issue":"4","key":"6_CR9","first-page":"433","volume":"1","author":"G Das","year":"1994","unstructured":"Das, G., Heffernan, P.J., Narasimhan, G.: Finding all weakly-visible chords of a polygon in linear time. Nord. J. Comput. 1(4), 433\u2013457 (1994)","journal-title":"Nord. J. Comput."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Kim, T., Demaine, E.D., Sarma, S.E.: A pseudopolynomial time $$O(\\log n)$$-approximation algorithm for art gallery problems. In: Algorithms and Data Structures, 10th International Workshop, WADS, pp. 163\u2013174 (2007)","DOI":"10.1007\/978-3-540-73951-7_15"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","volume":"100","author":"A Efrat","year":"2006","unstructured":"Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Inf. Process. Lett. 100(6), 238\u2013245 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-001-0040-8","volume":"31","author":"S Eidenbenz","year":"2001","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31(1), 79\u2013113 (2001)","journal-title":"Algorithmica"},{"key":"6_CR13","unstructured":"Friedrichs, S., Hemmer, M., King, J., Schmidt, C.: The continuous 1.5D terrain guarding problem: Discretization, Optimal solutions, and PTAS. JoCG 7(1), 256\u2013284 (2016)"},{"key":"6_CR14","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems, pp. 429\u2013434 (1997)"},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.dam.2009.12.004","volume":"158","author":"SK Ghosh","year":"2010","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discret. Appl. Math. 158(6), 718\u2013722 (2010)","journal-title":"Discret. Appl. Math."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0925-7721(93)90010-4","volume":"3","author":"SK Ghosh","year":"1993","unstructured":"Ghosh, S.K., Maheshwari, A., Pal, S.P., Saluja, S., Veni Madhavan, C.E.: Characterizing and recognizing weak visibility polygons. Comput. Geom. 3, 213\u2013233 (1993)","journal-title":"Comput. Geom."},{"issue":"1","key":"6_CR17","first-page":"168","volume":"5","author":"M Gibson","year":"2014","unstructured":"Gibson, M., Kanade, G., Krohn, E., Varadarajan, K.: Guarding terrains via local search. J. Comput. Geometry 5(1), 168\u2013178 (2014)","journal-title":"J. Comput. Geometry"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B Joe","year":"1987","unstructured":"Joe, B., Simpson, R.B.: Corrections to Lee\u2019s visibility polygon algorithm. BIT 27(4), 458\u2013473 (1987)","journal-title":"BIT"},{"key":"6_CR19","unstructured":"Katz, M.J.: A PTAS for vertex guarding weakly-visible polygons - an extended abstract. arXiv:1803.02160 (2018)"},{"key":"6_CR20","unstructured":"Ke, Y.: Detecting the weak visibility of a simple polygon and related problems. Technical report, Johns Hopkins University (1987)"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/s00454-011-9352-x","volume":"46","author":"J King","year":"2011","unstructured":"King, J., Kirkpatrick, D.G.: Improved approximation for guarding simple galleries from the perimeter. Discrete Comput. Geom. 46(2), 252\u2013269 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/s00453-012-9653-3","volume":"66","author":"E Krohn","year":"2013","unstructured":"Krohn, E., Nilsson, B.: Approximate guarding of monotone and rectilinear polygons. Algorithmica 66, 564\u2013594 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"DT Lee","year":"1983","unstructured":"Lee, D.T.: Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22(2), 207\u2013221 (1983)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32, 276\u2013282 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proceedings 25th Symposium on Computational Geometry, SoCG, pp. 17\u201322 (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"6_CR26","volume-title":"Art gallery theorems and algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms. Oxford Univ. Press, Oxford (1987)"},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Trans. Info. Theory 29(2), 181\u2013189 (1983)","journal-title":"IEEE Trans. Info. Theory"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Sack, J.-R., Suri, S.: An optimal algorithm for detecting weak visibility of a polygon (preliminary version). In: Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, STACS, pp. 312\u2013321 (1988)","DOI":"10.1007\/BFb0035855"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80879-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T22:04:21Z","timestamp":1638396261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80879-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030808785","9783030808792"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80879-2_6","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":"6 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2020.di.unipi.it\/WAOA2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.125","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.95","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}