Constructive discrepancy minimization with hereditary L2 guarantees
From MaRDI portal
Publication:5090499
Recommendations
Cites work
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- A trace bound for the hereditary discrepancy
- Algorithmic discrepancy beyond partial coloring
- An algorithm for Komlós conjecture matching Banaszczyk's bound
- Combinatorial discrepancy for boxes via the \(\gamma_2\) norm
- Constructive discrepancy minimization by walking on the edges
- Deterministic discrepancy minimization via the multiplicative weight update method
- Discrepancy of set-systems and matrices
- Factorization norms and hereditary discrepancy
- Geometric discrepancy. An illustrated guide
- Geometric methods in the study of irregularities of distribution
- On range searching in the group model and combinatorial discrepancy
- Six Standard Deviations Suffice
- The Gram-Schmidt walk: a cure for the Banaszczyk blues
- Tight hardness results for minimizing discrepancy
- Tight upper bounds for the discrepancy of half-spaces
- Tighter bounds for the discrepancy of boxes and polytopes
- ``Integer-making theorems
Cited in
(3)
This page was built for publication: Constructive discrepancy minimization with hereditary L2 guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090499)