Bounds and constructions for the star-discrepancy via δ-covers

Journal of Complexity

Volumn 21, Issue 5, 2005, Pages 691-709

  Doerr, Benjamin ^a   Gnewuch, Michael ^a   Srivastav, Anand ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Covering number; Derandomization; Low discrepancy point sets; Probabilistic methods; Star discrepancy

Indexed keywords

ALGORITHMS; NUMBER THEORY; POLYNOMIALS; PROBABILISTIC LOGICS; SET THEORY;

COVERING NUMBER; DERANDOMIZATION; LOW-DISCREPANCY POINT SETS; PROBABILISTIC METHODS; STAR-DISCREPANCY;

INTEGRATION;

EID: 27144490719     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2005.05.002     Document Type: Article

References (19)

1. S. Chari, P. Rohatgi, and A. Srinivasan Improved algorithms via approximation of probability distributions J. Comput. System Sci. 61 2000 81 107
2. M. Drmota, R.F. Tichy, Sequences, Discrepancies and Applications, Lecture Notes in Mathematics, vol. 1651, Springer, Berlin, 1997.
3. G. Even, O. Goldreich, M. Luby, N. Nisan, B. Veličković, Approximations of general independent distributions, in: Proceedings of the 24th ACM Symposium on Theory of Computing (STOC), 1992, pp. 10-16.
4. M. Gnewuch, Bounds for the average L p -extreme and the L ∞ -extreme discrepancy, Berichtsreihe des Mathematischen Seminars der Universität Kiel, Report 05-4, 2005.
5. M. Gnewuch, and B. Doerr Geometric discrepancies and δ -covers Oberwolfach Rep. 1 2004 687 690
6. D. Haussler Sphere packing numbers for subsets of the Boolean n -cube with bounded Vapnik-Chervonenkis dimension J. Combin. Theory Ser. A 69 1995 217 232
7. S. Heinrich Some open problems concerning the star-discrepancy J. Complexity 19 2003 416 419
8. S. Heinrich, E. Novak, G.W. Wasilkowski, and H. Woźniakowski The inverse of the star-discrepancy depends linearly on the dimension Acta Arith. 96 2001 279 302
9. F.J. Hickernell, I.H. Sloan, and G.W. Wasilkowski On tractability of weighted integration over bounded and unbounded regions in R s Math. Comp. 73 2004 1885 1901
10. A. Hinrichs Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy J. Complexity 20 2004 477 483
11. J. Matoušek Geometric Discrepancy 1999 Springer Berlin
12. H.N. Mhaskar On the tractability of multivariate integration and approximation by neural networks J. Complexity 20 2004 561 590
13. J. Naor, and M. Naor Small-bias probability spaces: efficient constructions and applications SIAM J. Comput. 22 4 1993 838 856
14. H. Niederreiter Number Generation and Quasi-Monte Carlo Methods 1992 SIAM Philadelphia
15. D. Pollard Convergence of Stochastic Processes 1984 Springer Berlin
16. P. Raghavan Probabilistic construction of deterministic algorithms: approximating packing integer programs J. Comput. System Sci. 37 1988 130 143
17. J. Spencer Ten Lectures on the Probabilistic Method 1987 SIAM Philadelphia
18. A. Srivastav Derandomization in Combinatorial Optimization Pardalos Rajasekaran Reif Rolim Handbook of Randomized Computing vol. II 2001 Kluwer Academic Publishers Dordrecht 731 842
19. A. Srivastav, and P. Stangier Algorithmic Chernoff-Hoeffding inequalities in integer programming Random Structures Algorithms 8 1996 27 58