Constructive algorithms for discrepancy minimization

DOI10.1109/FOCS.2010.7MaRDI QIDQ6990347zbMATH OpenFDO

Authors N. Bansal

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.7

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(10)

• A spectral bound on hypergraph discrepancy
• Revisit the partial coloring method: prefix spencer and sampling
• An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
• Average-case matrix discrepancy: satisfiability bounds
• Is the algorithmic Kadison-Singer problem hard?
• Weaver's discrepancy for Gaussian random vectors
• Smoothed analysis of the Komlós conjecture: Rademacher noise
• Smoothed analysis with adaptive adversaries
• From tcs to learning theory (invited paper)
• Efficient splitting of necklaces

This page was built for publication: Constructive algorithms for discrepancy minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990347)