{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:40Z","timestamp":1725500740414},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_3","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"5-16","source":"Crossref","is-referenced-by-count":5,"title":["A Novel Efficient Approach for Solving the Art Gallery Problem"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kr\u00f6ller","sequence":"first","affiliation":[]},{"given":"Mahdi","family":"Moeini","sequence":"additional","affiliation":[]},{"given":"Christiane","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Amit, Y., Mitchell, J.S.B., Packer, E.: Locating Guards for Visibility Coverage of Polygons. In: ALENEX, pp. 120\u2013134 (2007)","DOI":"10.1137\/1.9781611972870.12"},{"issue":"11","key":"3_CR2","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"},{"key":"3_CR3","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. Journal of Combinatorial Theory (B)\u00a018, 39\u201341 (1975)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"3_CR4","unstructured":"Computational Geometry Algorithms Library, \n                    \n                      http:\/\/www.cgal.org"},{"key":"3_CR5","first-page":"87","volume-title":"SIBGRAPI 2007: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing","author":"M.C. Couto","year":"2007","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. In: SIBGRAPI 2007: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing, pp. 87\u201394. IEEE Computer Society, Washington, DC (2007)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-68552-4_8","volume-title":"Experimental Algorithms","author":"M.C. Couto","year":"2008","unstructured":"Couto, M.C., de Souza, C.C., de Rezende, P.J.: Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 101\u2013113. Springer, Heidelberg (2008)"},{"key":"3_CR7","unstructured":"Couto, M.C., de Rezende, P.J., de Souza, C.C.: An Exact Algorithm for an Art Gallery Problem. Technical report, Institute of Computing, University of Campinas (November 2009)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","volume":"24","author":"S. Fisk","year":"1978","unstructured":"Fisk, S.: A Short Proof of Chv\u00e1tal\u2019s Watchman Theorem. Journal of Combinatorial Theory (B)\u00a024, 374\u2013375 (1978)","journal-title":"Journal of Combinatorial Theory (B)"},{"issue":"2","key":"3_CR9","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.K.: Computational Complexity of art gallery problems. IEEE Transactions on Information Theory\u00a032(2), 276\u2013282 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR10","first-page":"169","volume":"27","author":"H.A. Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Exact penalty in DC programming. Vietnam Journal of Mathematics\u00a027, 169\u2013178 (1999)","journal-title":"Vietnam Journal of Mathematics"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10287-009-0099-2","volume":"6","author":"H.A. Thi Le","year":"2009","unstructured":"Le Thi, H.A., Moeini, M., Pham Dinh, T.: Portfolio Selection under Downside Risk Measures and Cardinality Constraints based on DC Programming and DCA. Computational Management Science\u00a06(4), 477\u2013501 (2009)","journal-title":"Computational Management Science"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0604020","volume":"4","author":"M. Klawe","year":"1983","unstructured":"Klawe, M., Kleitman, D.: Traditional art galleries require fewer watchmen. SIAM Journal on Algebraic and Discrete Methods\u00a04(2), 194\u2013206 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"3_CR13","unstructured":"Kr\u00f6ller, A., Baumgartner, T., Fekete, S., Schmidt, C.: Exact Solutions and Bounds for General Art Gallery Problems. To appear in Journal of Experimental Algorithms"},{"key":"3_CR14","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)"},{"key":"3_CR15","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica. Dedicated to Professor Hoang Tuy on the Occasion of his 70th Birthday\u00a022(1), 289\u2013355 (1997)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM Journal on Optimization\u00a08, 476\u2013505 (1998)","journal-title":"SIAM Journal on Optimization"},{"key":"3_CR17","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\u00a031, 79\u2013113 (2001)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:35:01Z","timestamp":1620135301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}