Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

Journal of Complexity

Volumn 26, Issue 5, 2010, Pages 490-507

  Doerr, Benjamin ^a   Gnewuch, Michael ^b,c   Wahlstrm, Magnus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

^c Department of Earth and Environmental Sciences   (United States)

Author keywords

Derandomization; Low discrepancy points; Randomized rounding; Star discrepancy

Indexed keywords

GEOMETRY;

ALGORITHMIC CONSTRUCTION; DERANDOMIZATION; DETERMINISTIC ALGORITHMS; LOW-DISCREPANCY POINT SETS; LOW-DISCREPANCY POINTS; NUMERICAL COMPARISON; RANDOMIZED ROUNDING; STAR-DISCREPANCY;

STARS;

EID: 84755161857     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2010.03.004     Document Type: Conference Paper

References (33)

1. E. Atanassov On the discrepancy of the Halton sequences Math. Balkanica (N.S.) 18 2004 15 32
2. P. Bundschuh, and Y.C. Zhu A method for exact calculation of the discrepancy of low-dimensional point sets I Abh. Math. Sem. Univ. Hamburg 63 1993 115 133
3. L. de Clerk A method for exact calculation of the star-discrepancy of plane sets applied to the sequence of Hammersley Monatsh. Math. 101 1986 261 278
4. D.P. Dobkin, D. Eppstein, and D.P. Mitchell Computing the discrepancy with applications to supersampling patterns ACM Trans. Graph. 15 1996 354 376
5. B. Doerr Generating randomized roundings with cardinality constraints and derandomizations B. Durand, W. Thomas, Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS'06 LNiCS vol. 3884 2006 571 583
6. B. Doerr, and M. Gnewuch Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding A. Keller, S. Heinrich, H. Niederreiter, Monte Carlo and Quasi-Monte Carlo Methods 2006 2008 Springer Berlin, Heidelberg 299 312
7. B. Doerr, M. Gnewuch, P. Kritzer, and F. Pillichshammer Component-by-component construction of low-discrepancy point sets of small size Monte Carlo Methods Appl. 14 2008 129 149
8. B. Doerr, M. Gnewuch, and A. Srivastav Bounds and constructions for the star discrepancy via δ-covers J. Complexity 21 2005 691 709
9. B. Doerr, M. Gnewuch, and M. Wahlstrm Implementation of a component-by-component algorithm to generate small low-discrepancy samples P. L'Ecuyer, A.B. Owen, Monte Carlo and Quasi-Monte Carlo Methods 2008 2009 Springer Berlin, Heidelberg 323 338
10. B. Doerr, M. Wahlstrm, Randomized rounding in the presence of a cardinality constraint, in: Proceedings of ALENEX'09, 2009, pp. 162174.
11. M. Drmota, and R.F. Tichy Sequences, Discrepancies and Applications LNiM vol. 1651 1997 Springer Berlin, Heidelberg, New York
12. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan Dependent rounding and its applications to approximation algorithms J. ACM 53 2006 324 360
13. P. Giannopoulos, C. Knauer, M. Wahlstrm, D. Werner, Hardness and inapproximability results for discrepancy and related problems parameterized by the dimension (submitted for publication).
14. M. Gnewuch, A randomized algorithm to compute the star-discrepancy of a given n-point set, Kiel, manuscript, 2007.
15. M. Gnewuch Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy J. Complexity 24 2008 154 172
16. M. Gnewuch Construction of minimal bracketing covers for rectangles Electron. J. Combin. 15 1 2008 Research Paper 95
17. M. Gnewuch, A. Srivastav, and C. Winzen Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems J. Complexity 25 2009 115 127
18. J.M. Hammersley Monte Carlo methods for solving multivariable problems Ann. New York Acad. Sci. 86 1960 844 874
19. S. Heinrich, E. Novak, G.W. Wasilkowski, and H. Woniakowski The inverse of the star-discrepancy depends linearly on the dimension Acta Arith. 96 2001 279 302
20. F.J. Hickernell, I.H. Sloan, and G.W. Wasilkowski On tractability of weighted integration over bounded and unbounded regions in Rs Math. Comp. 73 2004 1885 1901
21. A. Hinrichs Covering numbers, Vapnikervonenkis classes and bounds for the star-discrepancy J. Complexity 20 2004 477 483
22. F. Kuo, Sobol sequence generator, Retrieved Dec. 1, 2009 from http://web.maths.unsw.edu.au/fkuo/sobol/index.html.
23. H. Niederreiter Random Number Generation and Quasi-Monte Carlo Methods 1992 SIAM Philadelphia
24. H. Niederreiter, and C. Xing Low-discrepancy sequences and global function fields with many rational places Finite Fields Appl. 2 1996 241 273 (Pubitemid 126167564)
25. A. Panconesi, and A. Srinivasan Randomized distributed edge coloring via an extension of the ChernoffHoeffding bounds SIAM J. Comput. 26 1997 350 368
26. P. Raghavan Probabilistic construction of deterministic algorithms: approximating packing integer programs J. Comput. Syst. Sci. 37 1988 130 143
27. I.M. Sobol The distribution of points in a cube and the approximate evaluation of integrals Zh. Vychisl. Mat. i Mat. Fiz. 7 1967 784 802 (in Russian)
28. A. Srinivasan, Distributions on level-sets with applications to approximations algorithms, in: Proceedings of FOCS'01, 2001, pp. 588597.
29. A. Srivastav, and P. Stangier Algorithmic ChernoffHoeffding inequalities in integer programming Random Structures Algorithms 8 1996 27 58
30. E. Thimard An algorithm to compute bounds for the star discrepancy J. Complexity 17 2001 850 880
31. E. Thimard, Economic generation of low-discrepancy sequences with a b-ary Gray code, in: EPFL-DMA-ROSO, RO981201, 1998, available at: http://rosowww.epfl.ch/papers/grayfaure/.
32. P. Winker, and K.T. Fang Application of threshold-accepting to the evaluation of the discrepancy of a set of points SIAM J. Numer. Anal. 34 1997 2028 2042
33. C. Winzen, Approximative Berechnung der Sterndiskrepanz, Diploma thesis [German], Institut fr Informatik, Christian-Albrechts-Universitt zu Kiel, Kiel, 2007.