TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES
TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an -point set , and a collection of subsets of , and our goal is color with two colors, red and …