{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:28:52Z","timestamp":1773235732910,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T00:00:00Z","timestamp":1240272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00454-009-9167-1","type":"journal-article","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T18:32:12Z","timestamp":1240252332000},"page":"379-398","source":"Crossref","is-referenced-by-count":1,"title":["Helly-Type Theorems for Approximate Covering"],"prefix":"10.1007","volume":"42","author":[{"given":"Julien","family":"Demouth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Glisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Goaoc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,21]]},"reference":[{"key":"9167_CR1","doi-asserted-by":"crossref","unstructured":"Amenta, N.: Helly theorems and generalized linear programming. PhD thesis, U.C. Berkeley (1993)","DOI":"10.1145\/160985.161000"},{"key":"9167_CR2","doi-asserted-by":"crossref","unstructured":"Amenta, N.: Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12 (1994)","DOI":"10.1007\/BF02574379"},{"issue":"1","key":"9167_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.2307\/2044407","volume":"86","author":"I. Barany","year":"1982","unstructured":"Barany, I., Katchalski, M., Pach, J.:: Quantitative Helly-type theorems. Proc. Am. Math. Soc. 86(1), 109\u2013114 (1982)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"9167_CR4","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/00029890.1984.11971432","volume":"91","author":"I. Barany","year":"1984","unstructured":"Barany, I., Katchalski, M., Pach, J.: Helly\u2019s theorem with volumes. Am. Math. Mon. 91(6), 362\u2013365 (1984)","journal-title":"Am. Math. Mon."},{"key":"9167_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Bronnimann","year":"1995","unstructured":"Bronnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14, 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9167_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37, 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9167_CR7","volume-title":"Radiosity and Realistic Image Synthesis","author":"M.F. Cohen","year":"1993","unstructured":"Cohen, M.F., Wallace, J.R.: Radiosity and Realistic Image Synthesis. Academic Press, New York (1993)"},{"key":"9167_CR8","series-title":"Proceedings of Symposia in Pure Mathematics","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1090\/pspum\/007\/0157289","volume-title":"Convexity","author":"L. Danzer","year":"1963","unstructured":"Danzer, L., Gr\u00fcnbaum, B., Klee, V.: Helly\u2019s theorem and its relatives. In: Klee, V. (ed.) Convexity, Proceedings of Symposia in Pure Mathematics, pp. 101\u2013180. Amer. Math. Soc., Reading (1963)"},{"key":"9167_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/B978-0-444-89596-7.50017-1","volume-title":"Handbook of Convex Geometry","author":"J. Eckhoff","year":"1993","unstructured":"Eckhoff, J.: Helly, Radon and Carath\u00e9odory type theorems. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, pp. 389\u2013448. North Holland, Amsterdam (1993)"},{"issue":"4","key":"9167_CR10","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"9167_CR11","series-title":"Lecture Notes in Computer Science","first-page":"669","volume-title":"13th Annual Symposium on Theoretical Aspects of Computer Science","author":"B. G\u00e4rtner","year":"1996","unstructured":"G\u00e4rtner, B., Welzl, E.: Linear programming\u2014randomization and abstract frameworks. In: 13th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1046, pp. 669\u2013687. Springer, Berlin (1996)"},{"key":"9167_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Proc. Sympos. IBM Thomas J. Watson Res. Center, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"5","key":"9167_CR13","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994)","journal-title":"J. ACM"},{"key":"9167_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0925-7721(93)90014-W","volume":"2","author":"M. Golin","year":"1993","unstructured":"Golin, M.: How many maxima can there be? Comput. Geom. Theory Appl. 2, 335\u2013353 (1993)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9167_CR15","unstructured":"Pach, J., Sharir, M.: Combinatorial Geometry with Algorithmic Applications, The Alcala Lectures, Alcala, Spain, August 31\u2013September 5, 2006"},{"key":"9167_CR16","doi-asserted-by":"crossref","unstructured":"Pellegrini, M.: Monte Carlo approximation of form factors with error bounded a priori. In: Symposium on Computational Geometry, pp. 287\u2013296 (1995)","DOI":"10.1145\/220279.220310"},{"key":"9167_CR17","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: The effect of corners on the complexity of approximate range searching. In: Symposium on Computational Geometry, pp.\u00a011\u201320 (2006)","DOI":"10.1145\/1137856.1137860"},{"key":"9167_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511617331","volume-title":"Integral Geometry and Geometric Probability","author":"L.A. Santalo","year":"2004","unstructured":"Santalo, L.A.: Integral Geometry and Geometric Probability, 2nd edn. Cambridge University Press, New York (2004)","edition":"2"},{"key":"9167_CR19","first-page":"569","volume-title":"STACS \u201992: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science","author":"M. Sharir","year":"1992","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: STACS \u201992: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, pp.\u00a0569\u2013579. Springer, Berlin (1992)"},{"key":"9167_CR20","volume-title":"Radiosity and Global Illumination","author":"F. Sillion","year":"1994","unstructured":"Sillion, F., Puech, C.: Radiosity and Global Illumination. Morgan Kaufmann, San Mateo (1994)"},{"key":"9167_CR21","first-page":"73","volume-title":"Handbook of Discrete & Computational Geometry","author":"R. Wenger","year":"2004","unstructured":"Wenger, R.: Helly-type theorems and geometric transversals. In: Goodman, J.E., O\u2019Raurke, J., (eds.) Handbook of Discrete & Computational Geometry, 2nd edn., pp. 73\u201396. CRC Press, Boca Raton (2004)","edition":"2"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9167-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9167-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9167-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:37Z","timestamp":1559087257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9167-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,21]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9167-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,21]]}}}