Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding

Monte Carlo and Quasi-Monte Carlo Methods 2006

Volumn , Issue , 2008, Pages 299-312

  Doerr, Benjamin ^a   Gnewuch, Michael ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; STARS;

DETERMINISTIC ALGORITHMS; HARD CONSTRAINTS; LOW-DISCREPANCY POINT SETS; RANDOMIZED ROUNDING; RUNTIMES; SMALL POINTS; STAR-DISCREPANCY;

MONTE CARLO METHODS;

EID: 47849130683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-74496-2_17     Document Type: Conference Paper

References (18)

1. [Ata04] E. Atanassov. On the discrepancy of the Halton sequences. Math. Balkanica (N.S.), 18, 15-32 (2004)
2. [Bec81] J. Beck. Balanced two-colorings of finite sets in the square. Combinatorica, 1, 327-335 (1981)
3. [Bec84] J. Beck. Some upper bounds in the theory of irregularities of distribution. Acta Arith., 44, 115-130 (1984)
4. [DGS05] B. Doerr, M. Gnewuch, and A. Srivastav. Bounds and constructions for the star discrepancy via d-covers. J. Complexity, 21, 691-709 (2005)
5. [DGY06] B. Doerr, S. Güntürk, and O. Yilmaz. Matrix Quasi-Rounding. Preprint (2006)
6. [Doe06] B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. In: Durand, B., Thomas, W. (eds) Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS'06), Lecture Notes in Comput. Sci., 3884, 571-583 (2006)
7. [Doe07] B. Doerr. Matrix approximation and Tusnády's problem. European J. Combin., 28, 990-995 (2007)
8. [Gne07] M. Gnewuch. Bracketing numbers for d-dimensional boxes and applications to geometric discrepancy. Preprint 21/2007, Max Planck Institute for Mathematics in the Sciences, Leipzig (2007)
9. [HNWW01] S. Heinrich, E. Novak, G.W. Wasilkowski, and H. Wózniakowski. The inverse of the star-discrepancy depends linearly on the dimension. Acta Arith., 96, 279-302 (2001)
10. [HSW04] 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, 1885-1901 (2004)
11. [Mha04] H.N. Mhaskar. On the tractability of multivariate integration and approximation by neural networks. J. Complexity, 20, 561-590 (2004)
12. [Nie92] H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)
13. [NX96] H. Niederreiter and C. Xing. Low-discrepancy sequences and global function fields with many rational places. Finite Fields Appl., 2, 241-273 (1996)
14. [Rag88] P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37, 130-143 (1988)
15. [Rot64] K.F. Roth. Remark concerning integer sequences. Acta Arith., 9, 257-260 (1964)
16. [Sch72] W.M. Schmidt. On irregularities of distribution VII. Acta Arith., 21, 45-50 (1972)
17. [SS96] A. Srivastav and P. Stangier. Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures Algorithms, 8, 27-58 (1996)
18. [Thi01] E. Thiémard. An algorithm to compute bounds for the star discrepancy. J. Complexity, 17, 850-880 (2001)