Deterministic discrepancy minimization

Authors:
Nikhil Bansal;Joel Spencer
Affiliations:
IBM T.J. Watson, Yorktown Hts., NY;New York University, New York
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 8
Cited 0

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Discrepancy theory

Handbook of combinatorics (vol. 2)
An Lp version of the Beck-Fiala conjecture

European Journal of Combinatorics
Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
The discrepancy method: randomness and complexity

The discrepancy method: randomness and complexity
Derandomized dimensionality reduction with applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Derandomization via Complexity Theory

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Constructive Algorithms for Discrepancy Minimization

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derandomize a recent algorithmic approach due to Bansal [2] to efficiently compute low discrepancy colorings for several problems. In particular, we give an efficient deterministic algorithm for Spencer's six standard deviations result [13], and to a find low discrepancy coloring for a set system with low hereditary discrepancy.