An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
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) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1/2</sup> ), matching the best known non-constructive bound for the problem …