Deterministic discrepancy minimization

Nikhil Bansal, Joel Spencer

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

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.

Original languageEnglish (US)
Title of host publicationAlgorithms, ESA 2011 - 19th Annual European Symposium, Proceedings
Pages408-420
Number of pages13
DOIs
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

Other

Other19th Annual European Symposium on Algorithms, ESA 2011
CountryGermany
CitySaarbrucken
Period9/5/119/9/11

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

    Bansal, N., & Spencer, J. (2011). Deterministic discrepancy minimization. In Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings (pp. 408-420). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6942 LNCS). https://doi.org/10.1007/978-3-642-23719-5_35