{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:54:48Z","timestamp":1742950488392,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642172885"},{"type":"electronic","value":"9783642172892"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17289-2_57","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T22:32:38Z","timestamp":1290205958000},"page":"592-601","source":"Crossref","is-referenced-by-count":5,"title":["Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Leach","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Mastroianni","sequence":"additional","affiliation":[]},{"given":"Jimmy","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"57_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(03)00027-0","volume":"26","author":"P. Bose","year":"2003","unstructured":"Bose, P., Kirkpatrick, D., Li, Z.: Worst-case-optimal algorithm for guarding planar graphs and polyhedral surfaces. Computational Geometry: Theory and Applications\u00a026(3), 209\u2013219 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Brimkov, V.E., Leach, A., Mastroianni, M., Wu, J.: Guarding a set of line segments in the plane. Theoretical Computer Science (2010), doi:10.1016\/j.tcs.2010.08.014","DOI":"10.1016\/j.tcs.2010.08.014"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/BF01456703","volume":"73","author":"H. Brunn","year":"1913","unstructured":"Brunn, H.: \u00dcber Kerneigebiete. Matt. Ann.\u00a073, 436\u2013440 (1913)","journal-title":"Matt. Ann."},{"key":"57_CR4","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman & Company, San Francisco (1979)"},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computation, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"3","key":"57_CR6","first-page":"189","volume":"- CIT 10","author":"B. Kaucic","year":"2002","unstructured":"\u01e8aucic, B., \u017dalik, B.: A new approach for vertex guarding of planar graphs. J. of Computing and Information Technology\u00a0- CIT 10(3), 189\u2013194 (2002)","journal-title":"J. of Computing and Information Technology"},{"key":"57_CR7","first-page":"309","volume":"19","author":"M.A. Krasnosel\u015bkii","year":"1946","unstructured":"Krasnosel\u015bkii, M.A.: Sur un Crit\u00e8re pour qu\u2019un Domain Soit \u00c9toil\u00e9. Mat. Sb.\u00a019, 309\u2013310 (1946)","journal-title":"Mat. Sb."},{"key":"57_CR8","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, Oxford (1987)"},{"key":"57_CR9","volume-title":"Combinatorial Optimization","author":"C.. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization. Prentice-Hall, New Jersey (1982)"},{"key":"57_CR10","volume-title":"Handbook of Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 22. North Holland, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17289-2_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T06:03:08Z","timestamp":1678255388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-17289-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642172885","9783642172892"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17289-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}