{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:52Z","timestamp":1742914312829,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_13","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"140-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00454-012-9429-1","volume":"48","author":"TC Biedl","year":"2012","unstructured":"Biedl, T.C., Irfan, M.T., Iwerks, J., Kim, J., Mitchell, J.S.B.: The art gallery theorem for polyominoes. Disc. Comp. Geom. 48(3), 711\u2013720 (2012)","journal-title":"Disc. Comp. Geom."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-54423-1_26","volume-title":"LATIN 2014: Theoretical Informatics","author":"S Durocher","year":"2014","unstructured":"Durocher, S., Filtser, O., Fraser, R., Mehrabi, A.D., Mehrabi, S.: A (7\/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 294\u2013305. Springer, Heidelberg (2014)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-40313-2_29","volume-title":"Mathematical Foundations of Computer Science 2013","author":"S Durocher","year":"2013","unstructured":"Durocher, S., Mehrabi, S.: Guarding orthogonal art galleries using sliding cameras: algorithmic and hardness results. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 314\u2013324. Springer, Heidelberg (2013)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-49381-6_45","volume-title":"Algorithms and Computation","author":"S Eidenbenz","year":"1998","unstructured":"Eidenbenz, S.: Inapproximability results for guarding polygons without holes. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, p. 427. Springer, Heidelberg (1998)"},{"key":"13_CR5","unstructured":"Eidenbenz, S.: Inapproximability of visibility problems on polygons and terrains. Ph.D. thesis, ETH Zurich (2000)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0925-7721(93)90013-V","volume":"2","author":"L Gewali","year":"1992","unstructured":"Gewali, L., Ntafos, S.C.: Covering grids and orthogonal polygons with periscope guards. Comput. Geom. 2, 309\u2013334 (1992)","journal-title":"Comput. Geom."},{"issue":"6","key":"13_CR7","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. Disc. App. Math. 158(6), 718\u2013722 (2010)","journal-title":"Disc. App. Math."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/BFb0032069","volume-title":"Automata, Languages and Programming","author":"F Hoffmann","year":"1990","unstructured":"Hoffmann, F.: On the rectilinear art gallery problem. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, pp. 717\u2013728. Springer, Heidelberg (1990)"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S0218195911003639","volume":"21","author":"MJ Katz","year":"2011","unstructured":"Katz, M.J., Morgenstern, G.: Guarding orthogonal art galleries with sliding cameras. Int. J. Comp. Geom. App. 21(2), 241\u2013250 (2011)","journal-title":"Int. J. Comp. Geom. App."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11751540_16","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"A Kosowski","year":"2006","unstructured":"Kosowski, A., Ma\u0142afiejski, M., \u017byli\u0144ski, P.: An efficient algorithm for mobile guarded guards in simple grids. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3980, pp. 141\u2013150. Springer, Heidelberg (2006)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comgeo.2006.11.002","volume":"37","author":"A Kosowski","year":"2007","unstructured":"Kosowski, A., Malafiejski, M., Zylinski, P.: Cooperative mobile guards in grids. Comp. Geom. 37(2), 59\u201371 (2007)","journal-title":"Comp. Geom."},{"issue":"3","key":"13_CR12","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.J.: Approximate guarding of monotone and rectilinear polygons. Algorithmica 66(3), 564\u2013594 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR13","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. Info. Theory 32(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Info. Theory"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. In: Proceedings of ACM SoCG, pp. 211\u2013223 (1988)","DOI":"10.1145\/73393.73415"},{"key":"13_CR15","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press Inc, New York (1987)"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/malq.19950410212","volume":"41","author":"D Schuchardt","year":"1995","unstructured":"Schuchardt, D., Hecker, H.: Two NP-hard art-gallery problems for ortho-polygons. Math. Log. Q. 41(2), 261\u2013267 (1995)","journal-title":"Math. Log. Q."},{"key":"13_CR17","unstructured":"Seddighin, S.: Guarding polygons with sliding cameras. Master\u2019s thesis, Sharif University of Technology (2014)"},{"issue":"1","key":"13_CR18","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume":"1","author":"J Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. Handb. Comp. Geom. 1(1), 973\u20131027 (2000). North-Holland","journal-title":"Handb. Comp. Geom."},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S0218195907002264","volume":"17","author":"C Worman","year":"2007","unstructured":"Worman, C., Keil, J.M.: Polygon decomposition and the orthogonal art gallery problem. Int. J. Comp. Geom. App. 17(2), 105\u2013138 (2007)","journal-title":"Int. J. Comp. Geom. App."}],"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-319-19315-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:32:41Z","timestamp":1676943161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}