{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:10Z","timestamp":1725488530336},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_10","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"24-35","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete"],"prefix":"10.1007","author":[{"given":"Euripides","family":"Markou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christodoulos","family":"Fragoudakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D. Lee","year":"1986","unstructured":"Lee, D., Lin, A., Computational complexity of art gallery problems, IEEE Trans. Inform. Theory 32, 276\u2013282, 1986.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR2","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, New York, 1987."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Shermer, T., Recent results in Art Galleries, Proc. of the IEEE, 1992.","DOI":"10.1109\/5.163407"},{"key":"10_CR4","unstructured":"Urrutia, J., Art gallery and Illumination Problems, Handbook on Comput. Geometry, 1998."},{"key":"10_CR5","unstructured":"Eidenbenz, S., (In-)Approximability of Visibility Problems on Polygons and Terrains, PhD Thesis, ETH Zurich, 2000."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3-540-49381-6_45","volume-title":"(ISAAC\u201998)","author":"S. Eidenbenz","year":"1998","unstructured":"Eidenbenz, S., Inapproximability Results for Guarding Polygons without Holes, Lecture notes in Computer Science, Vol. 1533 (ISAAC\u201998), p. 427\u2013436, 1998."},{"key":"10_CR7","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P., Inapproximability of some Art Gallery Problems, Proc. 10th Canadian Conf. Computational Geometry (CCCG\u201998), pp. 64\u201365, 1998."},{"key":"10_CR8","unstructured":"Ghosh, S., Approximation algorithms for Art Gallery Problems, Proc. of the Canadian Information Processing Society Congress, pp. 429\u2013434, 1987."},{"key":"10_CR9","unstructured":"Arora, S., Probabilistic Checking of Proofs and the Hardness of Approximation Problems, PhD thesis, Berkeley, 1994."},{"key":"10_CR10","unstructured":"Arora, S., Lund, C., Hardness of Approximations; in: Approximation Algorithms for NP-Hard Problems (Dorit Hochbaum ed.), pp. 399\u2013446, PWS Publishing Company, 1996."},{"key":"10_CR11","unstructured":"Hochbaum, D., Approximation Algorithms for NP-Hard Problems, PWS, 1996."},{"key":"10_CR12","unstructured":"Markou, E., Fragoudakis, C., Zachos, S., Approximating Visibility Problems within a constant, 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, Rome pp. 91\u2013103, 2002."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s003710050177","volume":"15","author":"A. Laurentini","year":"1999","unstructured":"Laurentini A., Guarding the walls of an art gallery, The Visual Computer Journal, (1999) 15:265\u2013278.","journal-title":"The Visual Computer Journal"},{"key":"10_CR14","unstructured":"Deneen L. L., Joshi S., Treasures in an art gallery, Proc. 4th Canadian Conf. Computational Geometry, pp. 17\u201322, 1992."},{"key":"10_CR15","unstructured":"Carlsson S., Jonsson H., Guarding a Treasury, Proc. 5th Canadian Conf. Computational Geometry, pp. 85\u201390, 1993."},{"key":"10_CR16","unstructured":"Markou, E., Zachos, S., Fragoudakis, C., Optimizing guarding costs for Art Galleries by choosing placement of art pieces and guards (submitted)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:20:27Z","timestamp":1550740827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}