{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:31:45Z","timestamp":1725550305643},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304678"},{"type":"electronic","value":"9783540320890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589440_6","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T07:08:15Z","timestamp":1131520095000},"page":"54-61","source":"Crossref","is-referenced-by-count":0,"title":["Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Br\u00f6nnimann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Clarkson, K., Varadarajan, K.: Improved Approximation Algorithms for Geometric Set Cover. To appear Proceedings of the Twenty First Annual Symposium on Computational Geometry, Pisa, Italy (2005)","DOI":"10.1145\/1064092.1064115"},{"key":"6_CR3","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2002","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2002)","edition":"2"},{"key":"6_CR4","unstructured":"Ezra, E., Sharir, M.: Output-sensitive construction of the union of triangles. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 420\u2013429 (2004)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J. Koml\u00f2s","year":"1992","unstructured":"Koml\u00f2s, J., Pach, J., Woeginger, G.J.: Almost Tight Bounds for epsilon-Nets. Discrete & Computational Geometry\u00a07, 163\u2013173 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, Berlin (2002)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Seidel, R., Welzl, E.: How to net a lot with little: small \u03b5-nets for disks and halfspaces. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, California, June 7-9, pp. 16\u201322 (1990)","DOI":"10.1145\/98524.98530"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jcss.1995.1018","volume":"50","author":"J. Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: Approximations and optimal geometric divide-and-conquer. J. Comput. Syst. Sci.\u00a050(2), 203\u2013208 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete & Computational Geometry\u00a08, 315\u2013334 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Nielsen, F.: Fast Stabbing of Boxes in High Dimensions. Theoretical Computer Science\u00a0246(1-2) (2000)","DOI":"10.1016\/S0304-3975(98)00336-3"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-002-1006-1","volume":"36","author":"M.J. Katz","year":"2003","unstructured":"Katz, M.J., Nielsen, F., Segal, M.: Maintenance of a Piercing Set for Intervals with Applications. Algorithmica\u00a036(1), 59\u201373 (2003)","journal-title":"Algorithmica"},{"key":"6_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. J. Wiley, New York (1995)"},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Combinatorial Theory, Ser. A\u00a013, 145\u2013147 (1972)","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S. Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific J. Math.\u00a041, 247\u2013261 (1972)","journal-title":"Pacific J. Math."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. Vapnik","year":"1971","unstructured":"Vapnik, V., \u010cervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl.\u00a016, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589440_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:01:36Z","timestamp":1605625296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589440_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304678","9783540320890"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11589440_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}