Fetching the paper…
Reading the bibliography…
We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets.
On tail probabilities for martingales
David A. Freedman · 1975
Earlier work this paper cites.
Integer-making theorems
József Beck and Tibor Fiala · 1981
Earlier work this paper cites.
Six standard deviations suffice
Joel Spencer · 1985
Earlier work this paper cites.
Discrepancy of set-systems and matrices
László Lovász, Joel Spencer, and Katalin Vesztergombi · 1986
Earlier work this paper cites.
Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
Aravind Srinivasan · 1997
Earlier work this paper cites.
Balancing vectors and gaussian measures of n-dimensional convex bodies
Wojciech Banaszczyk · 1998
Earlier work this paper cites.
The discrepancy method: randomness and complexity
Bernard Chazelle · 2000
Earlier work this paper cites.
Geometric discrepancy: An illustrated guide
Jiri Matousek · 2009
Earlier work this paper cites.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Earlier work this paper cites.
Tight hardness results for minimizing discrepancy
Moses Charikar, Alantha Newman, and Aleksandar Nikolov · 2011
Cited alongside, same era.
Approximation algorithms and semidefinite programming
Bernd Gärtner and Jiri Matousek · 2012
Cited alongside, same era.
Constructive discrepancy minimization by walking on the edges
Shachar Lovett and Raghu Meka · 2012
Cited alongside, same era.
The entropy rounding method in approximation algorithms
Thomas Rothvoss · 2012
Cited alongside, same era.
An improvement of the beck-fiala theorem
Boris Bukh · 2013
Cited alongside, same era.
The komlós conjecture holds for vector colorings
Aleksandar Nikolov · 2013
A Panorama of Discrepancy Theory
William Chen, Anand Srivastav, Giancarlo Travaglini, et al · 2014
Later among the works it cites.
Efficient algorithms for discrepancy minimization in convex sets
Ronen Eldan and Mohit Singh · 2014
Later among the works it cites.
Discrepancy without partial colorings
Nicholas J. A. Harvey, Roy Schwartz, and Mohit Singh · 2014
Later among the works it cites.
Constructive discrepancy minimization for convex sets
Thomas Rothvoss · 2014
Later among the works it cites.
Approximation-friendly discrepancy rounding
Nikhil Bansal and Viswanath Nagarajan · 2015
Later among the works it cites.
On the beck-fiala conjecture for random set systems
Esther Ezra and Shachar Lovett · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The geometry of differential privacy: the sparse and approximate cases
Aleksandar Nikolov, Kunal Talwar, and Li Zhang · 2013
Cited alongside, same era.
Approximating bin packing within o(log OPT * log log OPT) bins
Thomas Rothvoss · 2013
Cited alongside, same era.
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, and Shi Li · 2014
Cited alongside, same era.
Later among the works it cites.
Approximating hereditary discrepancy via small width ellipsoids
Aleksandar Nikolov and Kunal Talwar · 2015
Later among the works it cites.
Improved algorithmic bounds for discrepancy of sparse set systems
Nikhil Bansal and Shashwat Garg · 2016
Closest in time.