Construction of Low-discrepancy Point Sets of Small Size by Bracketing Covers 
and Dependent Randomized Rounding

Doerr, Benjamin; Gnewuch, Michael

Lokale TagsFreigabegeschichteDetailsÜbersicht

Construction of Low-discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding

Doerr, B., & Gnewuch, M.(2006). Construction of Low-discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding (06-14). Kiel: University Kiel.

Item is Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-E49F-6 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-E4A1-B

Genre: Bericht

ausblenden:

Urheber:
Doerr, Benjamin¹, Autor
Gnewuch, Michael², Autor

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Inhalt

einblenden:

ausblenden:

Schlagwörter: -

Zusammenfassung: 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.