{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:52Z","timestamp":1725489352395},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401940"},{"type":"electronic","value":"9783540448600"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44860-8_90","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:12:47Z","timestamp":1187251967000},"page":"869-878","source":"Crossref","is-referenced-by-count":5,"title":["Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains"],"prefix":"10.1007","author":[{"given":"Ana Paula","family":"Tom\u00e1s","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio Leslie","family":"Bajuelos","sequence":"additional","affiliation":[]},{"given":"F\u00e1bio","family":"Marques","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"90_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0031-3203(81)90002-9","volume":"13","author":"D. Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.: An efficient algorithm to decompose a polygon into starshaped pieces. Pattern Recognition 13 (1981) 295\u2013298.","journal-title":"Pattern Recognition"},{"key":"90_CR2","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. J. of Combinatorial Theory (Series B) 18 (1975) 39\u201341.","journal-title":"J. of Combinatorial Theory (Series B)"},{"key":"90_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0734-189X(84)80041-9","volume":"27","author":"H. Edelsbrunner","year":"1984","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Welzl, E.: Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing 27 (1984) 167\u2013176.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"90_CR4","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. Information Processing Letters 82 (2002) 99\u2013105.","journal-title":"Information Processing Letters"},{"key":"90_CR5","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. J. of Combinatorial Theory (Series B) 24 (1978) 374.","journal-title":"J. of Combinatorial Theory (Series B)"},{"key":"90_CR6","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T., Brisset, P.: Optimal Placement of Base Stations in Wireless Indoor Communication Networks. IEEE Intelligent Systems Magazine 15(1) (2000).","DOI":"10.1109\/5254.820329"},{"key":"90_CR7","unstructured":"Ghosh, S. K.: Approximation algorithms for art gallery problems. Proc. Canadian Information Processing Society Congress. (1987) 429\u2013434."},{"key":"90_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256\u2013278.","journal-title":"J. Comput. System Sci."},{"key":"90_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0604020","volume":"4","author":"J. Kahn","year":"1983","unstructured":"Kahn, J., Klawe, M., Kleitman, D.: Traditional galleries require fewer watchmen. SIAM J. Algebraic and Discrete Methods 4 (1983) 194\u2013206.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"90_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"IT-32","author":"D. T. Lee","year":"1986","unstructured":"Lee, D. T., Lin, A. K.: Computational complexity of art gallery problems. IEEE Transaction on Information Theory IT-32 (1986) 276\u2013282.","journal-title":"IEEE Transaction on Information Theory"},{"key":"90_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"D. T. Lee","year":"1983","unstructured":"Lee, D. T.: Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing 22 (1983) 207\u2013221.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"90_CR12","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms, 11st Ed., MIT Press (1994) 974\u2013978."},{"key":"90_CR13","doi-asserted-by":"crossref","unstructured":"Marriott, K., Stuckey, P.: Programming with Constraints \u2014 An Introduction, MIT Press (1998).","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"90_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01918136","volume":"21","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: An alternate proof of the rectilinear art gallery theorem. J. of Geometry 21 (1983) 118\u2013130.","journal-title":"J. of Geometry"},{"key":"90_CR15","unstructured":"Sack, J. R., Toussaint, G.: Guard placement in rectilinear polygons. Computational Morphology. G. T. Toussaint, ed., Elsevier Science Publishers (1988) 153\u2013175."},{"key":"90_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 problems for ortho-polygons. Math. Logiv Quart. 41 (1995) 261\u2013267.","journal-title":"Math. Logiv Quart"},{"key":"90_CR17","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Art gallery and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometry. Elsevier (2000).","DOI":"10.1016\/B978-044482537-7\/50023-1"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44860-8_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:34:40Z","timestamp":1556757280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44860-8_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401940","9783540448600"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44860-8_90","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}