Deterministic discrepancy minimization

Nikhil Bansal, Joel Spencer

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationAlgorithms, ESA 2011 - 19th Annual European Symposium, Proceedings
Number of pages13
StatePublished - 2011
Event19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany
Duration: Sep 5 2011Sep 9 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6942 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other19th Annual European Symposium on Algorithms, ESA 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Deterministic discrepancy minimization'. Together they form a unique fingerprint.

Cite this