{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:44:04Z","timestamp":1725900244800},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_29","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"320-336","source":"Crossref","is-referenced-by-count":8,"title":["The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm"],"prefix":"10.1007","author":[{"given":"Davi C.","family":"Tozoni","sequence":"first","affiliation":[]},{"given":"Pedro J.","family":"de Rezende","sequence":"additional","affiliation":[]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Amit, Y., Mitchell, J.S.B., Packer, E.: Locating guards for visibility coverage of polygons. In: ALENEX, New Orleans, Lousiana (January 2007)","DOI":"10.1137\/1.9781611972870.12"},{"issue":"6","key":"29_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0031-3203(81)90002-9","volume":"13","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition\u00a013(6), 395\u2013398 (1981)","journal-title":"Pattern Recognition"},{"issue":"11","key":"29_CR3","doi-asserted-by":"publisher","first-page":"3343","DOI":"10.1016\/j.patcog.2008.05.001","volume":"41","author":"A. Bottino","year":"2008","unstructured":"Bottino, A., Laurentini, A.: A nearly optimal sensor placement algorithm for boundary coverage. Pattern Recognition\u00a041(11), 3343\u20133355 (2008)","journal-title":"Pattern Recognition"},{"issue":"5","key":"29_CR4","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1016\/j.patcog.2010.11.010","volume":"44","author":"A. Bottino","year":"2011","unstructured":"Bottino, A., Laurentini, A.: A nearly optimal algorithm for covering the interior of an art gallery. Pattern Recognition\u00a044(5), 1048\u20131056 (2011)","journal-title":"Pattern Recognition"},{"key":"29_CR5","unstructured":"CGAL. Computational Geometry Algorithms Library, www.cgal.org (last access January 2012)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. Journ. of Combin. Theory Series B\u00a018, 39\u201341 (1975)","journal-title":"Journ. of Combin. Theory Series B"},{"issue":"02n03","key":"29_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1142\/S0218195906002002","volume":"16","author":"K.-Y. Chwa","year":"2006","unstructured":"Chwa, K.-Y., Jo, B.-C., Knauer, C., Moet, E., van Oostrum, R., Shin, C.-S.: Guarding art galleries by guarding witnesses. Intern. Journal of Computational Geometry and Applications\u00a016(02n03), 205\u2013226 (2006)","journal-title":"Intern. Journal of Computational Geometry and Applications"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1111\/j.1475-3995.2011.00804.x","volume":"18","author":"M.C. Couto","year":"2011","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: An exact algorithm for minimizing vertex guards on art galleries. International Transactions in Operational Research\u00a018(4), 425\u2013448 (2011)","journal-title":"International Transactions in Operational Research"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Couto, M.C., de Souza, C.C., de Rezende, P.J.: An exact and efficient algorithm for the orthogonal art gallery problem. In: Proc. of the XX Brazilian Symp. on Comp. Graphics and Image Processing, pp. 87\u201394. IEEE Computer Society (2007)","DOI":"10.1109\/SIBGRAPI.2007.15"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0020-0190(01)00255-1","volume":"82","author":"S. Eidenbenz","year":"2002","unstructured":"Eidenbenz, S.: Approximation algorithms for terrain guarding. Inf. Process. Lett.\u00a082(2), 99\u2013105 (2002)","journal-title":"Inf. Process. Lett."},{"key":"29_CR11","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems. In: Proc. Canadian Inform. Process. Soc. Congress (1987)"},{"key":"29_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"6","key":"29_CR13","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.dam.2009.12.004","volume":"158","author":"S.K. Ghosh","year":"2010","unstructured":"Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discrete Applied Mathematics\u00a0158(6), 718\u2013722 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Honsberger, R.: Mathematical Gems II. The Dolciani Mathematical Expositions, vol.\u00a02. MAA (1976)","DOI":"10.1090\/dol\/002"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ller, A., Baumgartner, T., Fekete, S.P., Moeini, M., Schmidt, C.: Practical solutions and bounds for art gallery problems (August 2012), http:\/\/ismp2012.mathopt.org\/show-abs?abs=1046","DOI":"10.1145\/2133803.2184449"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ller, A., Baumgartner, T., Fekete, S.P., Schmidt, C.: Exact solutions and bounds for general art gallery problems. J. Exp. Algorithmics 17(1), 2.3:2.1\u20132.3:2.23 (2012)","DOI":"10.1145\/2133803.2184449"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D.T. Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory\u00a032(2), 276\u2013282 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR18","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, New York (1987)"},{"issue":"9","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. Shermer","year":"1992","unstructured":"Shermer, T.: Recent results in art galleries. Proceedings of the IEEE\u00a080(9), 1384\u20131399 (1992)","journal-title":"Proceedings of the IEEE"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131027. North-Holland (2000)","DOI":"10.1016\/B978-044482537-7\/50023-1"},{"key":"29_CR21","unstructured":"XPRESS. Xpress Optimization Suite (2009), http:\/\/www.fico.com\/en\/Products\/DMTools\/Pages\/FICO-Xpress-Optimization-Suite.aspx (access January 2012)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T13:19:37Z","timestamp":1645017577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}