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. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Bansal, N., & Spencer, J. (2011). Deterministic discrepancy minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 408–420). https://doi.org/10.1007/978-3-642-23719-5_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free