{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:47:43Z","timestamp":1769975263757,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_58","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"629-640","source":"Crossref","is-referenced-by-count":14,"title":["A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains"],"prefix":"10.1007","author":[{"given":"James","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Aggarwal, A.: The art gallery problem: Its variations, applications, and algorithmic aspects. PhD thesis, Johns Hopkins University (1984)"},{"key":"58_CR2","unstructured":"Ben-Moshe, B.: Personal communication (2005)"},{"key":"58_CR3","unstructured":"Ben-Moshe, B., Katz, M., Mitchell, J.: A constant-factor approximation algorithm for optimal terrain guarding. In: Symposium on Discrete Algorithms (2005)"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry 14 (1995)","DOI":"10.1007\/BF02570718"},{"key":"58_CR5","unstructured":"Chen, D.Z., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains (extended abstract) (1996)"},{"key":"58_CR6","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. Comb. Theory Series B\u00a018, 39\u201341 (1975)","journal-title":"J. Comb. Theory Series B"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Symposium on Computational Geometry (2005)","DOI":"10.1145\/1064092.1064115"},{"key":"58_CR8","unstructured":"Eidenbenz, S.: (In-)Approximability of Visibility Problems on Polygons and Terrains. PhD thesis, ETH Zurich (2000)"},{"issue":"2","key":"58_CR9","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\u00a082(2), 99\u2013105 (April 2002)","journal-title":"Information Processing Letters"},{"key":"58_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-68530-8_16","volume-title":"Algorithms - ESA \u201998","author":"S. Eidenbenz","year":"1998","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Positioning guards at fixed height above a terrain\u2014an optimum inapproximability result. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, p. 187. Springer, Heidelberg (1998)"},{"issue":"1","key":"58_CR11","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(1), 79\u2013113 (2001)","journal-title":"Algorithmica"},{"issue":"4","key":"58_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"58_CR13","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"58_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: \u03b5-Nets and Simplex Range Queries. Discrete & Computational Geometry\u00a02, 127\u2013151 (1987)","journal-title":"Discrete & Computational Geometry"},{"key":"58_CR15","unstructured":"King, J.: Approximation algorithms for the 1.5 dimensional terrain guarding problem. Master\u2019s thesis, University of British Columbia (2005)"},{"key":"58_CR16","doi-asserted-by":"crossref","unstructured":"Kooshesh, A.A., Moret, B.M.E.: Three-coloring the vertices of a triangulated simple polygon. Pattern Recognition 25 (1992)","DOI":"10.1016\/0031-3203(92)90093-X"},{"key":"58_CR17","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, 276\u2013282 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"58_CR18","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel sequences and their geometric applications. Technical report (1995)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:44Z","timestamp":1555445924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11682462_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}