hide
Free keywords:
-
Abstract:
We provide a deterministic algorithm that constructs small point sets
exhibiting a low star discrepancy. The algorithm is based on bracketing and on
recent results on randomized roundings respecting hard constraints. It is
structurally much simpler than the previous algorithm presented for this
problem in [B. Doerr, M. Gnewuch, A. Srivastav. Bounds and constructions for
the star discrepancy via -covers. J. Complexity, 21: 691-709, 2005]. Besides
leading to better theoretical run time bounds, our approach can be implemented
with reasonable effort.