Answers are grounded in this paper and cite their sources.
We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets. We give an efficient algorithm that finds a coloring with discrepancy O((t log n)1/2), matching the best known nonconstructive bound for the problem due to Banaszczyk. The previous algorithms only achieved an O(t1/2 log n) bound. The result also extends to the more general Komlós setting and gives an algorithmic O(log1/2 n) bound.
No takes yet. Share an insight, caveat, or question.
Bansal et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: