{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:44Z","timestamp":1725550484370},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_14","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T06:06:19Z","timestamp":1130133979000},"page":"145-154","source":"Crossref","is-referenced-by-count":2,"title":["How to Place Efficiently Guards and Paintings in an Art Gallery"],"prefix":"10.1007","author":[{"given":"Christodoulos","family":"Fragoudakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_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\u00a032, 276\u2013282 (1986)","journal-title":"IEEE Trans. Inform.Theory"},{"key":"14_CR2","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":"14_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. Shmoys","year":"1993","unstructured":"Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming A\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming A"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Shermer, T.: Recent results in Art Galleries. Proc. of the IEEE (1992)","DOI":"10.1109\/5.163407"},{"key":"14_CR5","unstructured":"Urrutia, J.: Art gallery and Illumination Problems. Handbook on Computational Geometry (1998)"},{"key":"14_CR6","unstructured":"Eidenbenz, S.: (In-)Approximability of Visibility Problems on Polygons and Terrains, PhD Thesis, ETH Zurich (2000)"},{"key":"14_CR7","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.\u00a01533, pp. 427\u2013436. Springer, Heidelberg (1998)"},{"key":"14_CR8","unstructured":"Ghosh, S.: Approximation algorithms for Art Gallery Problems. In: Proc. of the Canadian Information Processing Society Congress, pp. 429\u2013434 (1987)"},{"key":"14_CR9","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1996)"},{"key":"14_CR10","unstructured":"Hochbaum, D.: Approximating Covering and Packing Problems. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94\u2013143. PWS Publishing Company (1996)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proc. 1st Ann. ACM Symposium Computational Geometry, pp. 161\u2013167 (1985)","DOI":"10.1145\/323233.323255"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01840404","volume":"5","author":"D. Dobkin","year":"1990","unstructured":"Dobkin, D., Edelsbrunner, H., Overmars, H.: Searching for Empty Convex Polygons. Algorithmica\u00a05, 561\u2013571 (1990)","journal-title":"Algorithmica"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.: Topologically sweeping an arrangement. J. Comput. System Sci.\u00a038, 165\u2013194 (1989)","journal-title":"J. Comput. System Sci."},{"key":"14_CR14","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack problem. In: Proc. 11th ACM Symp on Discrete Algorithms, pp. 213\u2013222 (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:48Z","timestamp":1619491248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11573036_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}