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

The authors propose a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is much simpler than a previous one proposed by \textit{B.~Doerr}, \textit{M.~Gnewuch}, and \textit{A.~Srivastav} [J. Complexity 21, No.~5, 691--709 (2005; Zbl 1115.11046)]. The section ``Numerical experiments'' contains a numerous tables and plots which compare the authors' construction with others. From the abstract: ``\dots our algorithm leads to superior results if the dimension is relatively high and the number of points that have to be constructed is rather small.''