{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:47:30Z","timestamp":1768740450314,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540571551","type":"print"},{"value":"9783540479185","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_252","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:25Z","timestamp":1330257925000},"page":"246-252","source":"Crossref","is-referenced-by-count":28,"title":["Algorithms for polytope covering and approximation"],"prefix":"10.1007","author":[{"given":"Kenneth L.","family":"Clarkson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","volume":"2","author":"K. L. Clarkson","year":"1987","unstructured":"K. L. Clarkson. New applications of random sampling in computational geometry. Discrete and Computational Geometry, 2:195\u2013222, 1987.","journal-title":"Discrete and Computational Geometry"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29ih IEEE Symp. on Foundations of Computer Science, pages 452\u2013456, 1988. Revised version: Las Vegas algorithms for linear and integer programming when the dimension is small (preprint).","DOI":"10.1109\/SFCS.1988.21961"},{"key":"24_CR3","unstructured":"G. Das and D. Joseph. The complexity of minimum nested polyhedra. In Canadian Conference on Computational Geometry, 1990."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete and Computational Geometry, 2:127\u2013151, 1987.","journal-title":"Discrete and Computational Geometry"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. In Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 68\u201377, 1987.","DOI":"10.1109\/SFCS.1987.37"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek. Reporting points in halfspaces. Computational Geometry: Theory and Applications, pages 169\u2013186, 1992.","DOI":"10.1016\/0925-7721(92)90006-E"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek and O. Schwartzkopf. Linear optimization queries. In Proc. Eighth ACM Symp. on Comp. Geometry, pages 16\u201325, 1992.","DOI":"10.1145\/142675.142683"},{"key":"24_CR8","unstructured":"J. Mitchell and S. Suri. Separation and approximation of polyhedral objects. In Proc. 3rd ACM Symp. on Discrete Algorithms, pages 296\u2013306, 1992."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"E. Welzl. Partition trees for triangle counting and other range searching problems. In Proc. Fourth ACM Symp. on Comp. Geometry, pages 23\u201333, 1988.","DOI":"10.1145\/73393.73397"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_252.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:18Z","timestamp":1605647298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_252","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}