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

Benjamin Doerr () and Michael Gnewuch ()
Additional contact information
Benjamin Doerr: Max-Planck-Institut für Informatik
Michael Gnewuch: Christian-Albrechts-Universität zu Kiel, Institut für Informatik

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2006, 2008, pp 299-312 from Springer

Abstract: Summary 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 also can be implemented with reasonable effort.

Keywords: Hard Constraint; Deterministic Algorithm; Star Discrepancy; Binary Length; Randomize Rounding (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-74496-2_17

Ordering information: This item can be ordered from
http://www.springer.com/9783540744962

DOI: 10.1007/978-3-540-74496-2_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().