{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:39:30Z","timestamp":1769978370599,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030394783","type":"print"},{"value":"9783030394790","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39479-0_1","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T20:03:47Z","timestamp":1579896227000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains"],"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"}]},{"given":"Rachel","family":"Saban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"1_CR1","unstructured":"Ahmed, A.R., et al.: L-graphs and monotone L-graphs. \narXiv:1703.01544\n\n (2017)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27\u201331 August 2018, Liverpool, UK, pp. 37:1\u201337:15 (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.37","DOI":"10.4230\/LIPIcs.MFCS.2018.37"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1631","DOI":"10.1137\/S0097539704446384","volume":"36","author":"Boaz Ben\u2010Moshe","year":"2007","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)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR4","unstructured":"Bhattacharya, P., Ghosh, S.K., Pal, S.: Constant approximation algorithms for guarding simple polygons using vertex guards. \narXiv:1712.05492\n\n (2017)"},{"key":"1_CR5","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. Discrete Appl. Math. 228, 109\u2013129 (2017)","journal-title":"Discrete Appl. Math."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2015.08.019","volume":"216","author":"Daniele Catanzaro","year":"2017","unstructured":"Catanzaro, D., et al.: Max point-tolerance graphs. Discrete Appl. Math. 216, 84\u201397 (2017). \nhttps:\/\/doi.org\/10.1016\/j.dam.2015.08.019","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s00454-014-9661-y","volume":"53","author":"Jos\u00e9 Correa","year":"2015","unstructured":"Correa, J.R., Feuilloley, L., P\u00e9rez-Lantero, P., Soto, J.A.: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity. Discrete Comput. Geom. 53(2), 344\u2013365 (2015). \nhttps:\/\/doi.org\/10.1007\/s00454-014-9661-y","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"1_CR10","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"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00453-009-9358-4","volume":"60","author":"Khaled Elbassioni","year":"2009","unstructured":"Elbassioni, K., Krohn, E., Matijevi\u0107, D., Mestre, J., \u0160everdija, D.: Improved approximations for guarding 1.5-dimensional terrains. Algorithmica 60(2), 451\u2013463 (2011)","journal-title":"Algorithmica"},{"key":"1_CR12","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). \nhttp:\/\/jocg.org\/index.php\/jocg\/article\/view\/242"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0925-7721(93)90010-4","volume":"3","author":"Subir Kumar Ghosh","year":"1993","unstructured":"Ghosh, S.K., Maheshwari, A., Pal, S.P., Saluja, S., Madhavan, C.E.V.: Characterizing and recognizing weak visibility polygons. Comput. Geom. 3, 213\u2013233 (1993). \nhttps:\/\/doi.org\/10.1016\/0925-7721(93)90010-4","journal-title":"Computational Geometry"},{"issue":"1","key":"1_CR14","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. Geom. 5(1), 168\u2013178 (2014)","journal-title":"J. Comput. Geom."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-15775-2_21","volume-title":"Algorithms \u2013 ESA 2010","author":"M Gibson","year":"2010","unstructured":"Gibson, M., Pirwani, I.A.: Algorithms for dominating set in disk graphs: breaking the logn barrier. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 243\u2013254. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15775-2_21"},{"key":"1_CR16","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). \nhttps:\/\/doi.org\/10.1007\/11682462_58"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"James King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011). \nhttps:\/\/doi.org\/10.1137\/100791506","journal-title":"SIAM Journal on Computing"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proceedings of the 25th Annual Symposium on Computational Geometry, pp. 17\u201322. ACM (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"1_CR19","unstructured":"Soto, M., Caro, C.T.: $$p$$-box: a new graph model. Discrete Math. Theoret. Comput. Sci. 17(1), 169\u2013186 (2015). \nhttp:\/\/dmtcs.episciences.org\/2121"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39479-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:04:01Z","timestamp":1583741041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39479-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394783","9783030394790"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39479-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-waoa\/waoa-overview","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}