Construction of minimal bracketing covers for rectangles

Electronic Journal of Combinatorics

Volumn 15, Issue 1, 2008, Pages

  Gnewuch, Michael ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 47849091233     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/819     Document Type: Article

References (23)

1. J. Beck, Some upper bounds in the theory of irregularities of distribution, Acta Arith. 44 (1984) 115-130.
2. J. Beck, W. W. Chen, Irregularities of Distribution, Cambridge University Press, Cambridge, 1987.
3. B. Chazelle, The Discrepancy Method, Cambridge University Press, New York, 2000.
4. L. Devroye, G. Lugosi, Combinatorial Methods in Density Estimation, Springer series in statistics, Springer-Verlag, New York, 2001.
5. J. Dick, A note on the existence of sequences with small star discrepancy, J. Complexity 23 (2007) 649-652.
6. B. Doerr, M. Gnewuch, Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding, in: A. Keller, S. Heinrich, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312, Springer, Berlin Heidelberg, 2008.
7. B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer, Component-by- component construction of small low-discrepancy point sets, to appear in Monte Carlo Methods Appl..
8. B. Doerr, M. Gnewuch, A. Srivastav, Bounds and constructions for the star-discrepancy via δ-covers, J. Complexity 21 (2005) 691-709.
9. M. Drmota, R. F. Tichy, Sequences, Discrepancies and Applications, Lecture Notes in Mathematics, vol. 1651, Springer, Berlin, 1997.
10. ∞-extreme discrepancy, Electron. J. Combin. 12 (2005), Research Paper 54, 11 pp.
11. M. Gnewuch, Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy, J. Complexity 24 (2008) 154-172.
12. D. Haussler, Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension, J. Comb. Theory A 69 (1995) 217-232.
13. S. Heinrich, E. Novak, G. W. Wasilkowski, H. Woźniakowski, The inverse of the star-discrepancy depends linearly on the dimension, Acta Arith. 96 (2001) 279-302.
14. s, Math. Comp. 73 (2004) 1885-1905.
15. A. Hinrichs, Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy, J. Complexity 20 (2004) 477-483.
16. J. Matoušek, Geometric Discrepancy, Springer, Berlin, 1999.
17. H. N. Mhaskar, On the tractability of multivariate integration and approximation by neural networks, J. Complexity 20 (2004) 561-590.
18. H. Niederreiter, Pseudo Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
19. E. Novak, H. Woźniakowski, When are integration and discrepancy tractable?, in: R. A. DeVore, A. Iserles, E. Süli (Eds.), Foundations of Computational Mathematics, Cambridge University Press, 2001, pp. 211-266.
20. M. Talagrand, Sharper bounds for Gaussian and empirical processes, Ann. Prob. 22 (1994) 28-76.
21. E. Thiémard, Computing bounds for the star discrepancy, Computing 65 (2000) 169-186.
22. E. Thiémard, An algorithm to compute bounds for the star discrepancy, J. Complexity 17 (2001) 850-880.
23. A. W. van der Vaart, J. A. Wellner, Weak Convergence and Empirical Processes, Springer Series in Statistics, Springer, New York, 1996.