Fetching the paper…
Reading the bibliography…
Efficiently computing low discrepancy colorings of various set systems, has been studied extensively since the breakthrough work by Bansal (FOCS 2010), who gave the first polynomial time algorithms for several important settings, including for general set systems, sparse set systems and for set systems with bounded hereditary discrepancy.
Integer-making theorems
J. Beck and T. Fiala · 1981
Earlier work this paper cites.
Six standard deviations suffice
J. Spencer · 1985
Earlier work this paper cites.
Discrepancy of set-systems and matrices
L. Lovász, J. Spencer, and K. Vesztergombi · 1986
Earlier work this paper cites.
Geometric methods in the study of irregularities of distribution
R. Alexander · 1990
Earlier work this paper cites.
Tight upper bounds for the discrepancy of half-spaces
J. Matoušek · 1995
Earlier work this paper cites.
A. Srinivasan · 1997
Earlier work this paper cites.
Balancing vectors and gaussian measures of n-dimensional convex bodies
W. Banaszczyk · 1998
Earlier work this paper cites.
Geometric Discrepancy: An Illustrated Guide
J. Matousek · 1999
Earlier work this paper cites.
The Discrepancy Method: Randomness and Complexity
B. Chazelle · 2000
Earlier work this paper cites.
A trace bound for the hereditary discrepancy
B. Chazelle and A. Lvov · 2000
Cited alongside, same era.
Constructive algorithms for discrepancy minimization
N. Bansal · 2010
Cited alongside, same era.
Tight hardness results for minimizing discrepancy
M. Charikar, A. Newman, and A. Nikolov · 2011
Cited alongside, same era.
A variant of azuma’s inequality for martingales with subgaussian tails
O. Shamir · 2011
Cited alongside, same era.
On range searching in the group model and combinatorial discrepancy
K. G. Larsen · 2014
Cited alongside, same era.
Factorization norms and hereditary discrepancy
J. Matoušek, A. Nikolov, and K. Talwar · 2014
An algorithm for komlós conjecture matching banaszczyk’s bound
N. Bansal, D. Dadush, and S. Garg · 2016
Later among the works it cites.
Constructive discrepancy minimization for convex sets
T. Rothvoss · 2017
Later among the works it cites.
Balancing vectors in any norm
D. Dadush, A. Nikolov, K. Talwar, and N. Tomczak-Jaegermann · 2018
Later among the works it cites.
Efficient algorithms for discrepancy minimization in convex sets
R. Eldan and M. Singh · 2018
Later among the works it cites.
Factorization Norms and Hereditary Discrepancy
J. Matoušek, A. Nikolov, and K. Talwar · 2018
Later among the works it cites.
Constructive discrepancy minimization with hereditary L2 guarantees
K. G. Larsen · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Constructive discrepancy minimization by walking on the edges
S. Lovett and R. Meka · 2015
Cited alongside, same era.
Combinatorial Discrepancy for Boxes via the gamma_2 Norm
J. Matoušek and A. Nikolov · 2015
Cited alongside, same era.
A faster interior point method for semidefinite programming
H. Jiang, T. Kathuria, Y. T. Lee, S. Padmanabhan, and Z. Song · 2020
Later among the works it cites.
Discrepancy minimization via a self-balancing walk
R. Alweiss, Y. P. Liu, and M. Sawhney · 2021
Later among the works it cites.