Algorithmic discrepancy beyond partial coloring

The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number of times, and the errors can add up in an adversarial way.

Authors

• Nikhil Bansal 0001
• Shashwat Garg

Keywords

No keywords are indexed for this paper.