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
Volume6942 LNCS
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Coloring
Discrepancy
Colouring
Set Systems
Deterministic Algorithm
Standard deviation
Efficient Algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bansal, N., & Spencer, J. (2011). Deterministic discrepancy minimization. In Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings (Vol. 6942 LNCS, 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

Deterministic discrepancy minimization. / Bansal, Nikhil; Spencer, Joel.

Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. Vol. 6942 LNCS 2011. p. 408-420 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6942 LNCS).

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

Bansal, N & Spencer, J 2011, Deterministic discrepancy minimization. in Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. vol. 6942 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6942 LNCS, pp. 408-420, 19th Annual European Symposium on Algorithms, ESA 2011, Saarbrucken, Germany, 9/5/11. https://doi.org/10.1007/978-3-642-23719-5_35
Bansal N, Spencer J. Deterministic discrepancy minimization. In Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. Vol. 6942 LNCS. 2011. p. 408-420. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-23719-5_35
Bansal, Nikhil ; Spencer, Joel. / Deterministic discrepancy minimization. Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. Vol. 6942 LNCS 2011. pp. 408-420 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4d16d46f6b5141f0957e29ff540745f1,
title = "Deterministic discrepancy minimization",
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.",
author = "Nikhil Bansal and Joel Spencer",
year = "2011",
doi = "10.1007/978-3-642-23719-5_35",
language = "English (US)",
isbn = "9783642237188",
volume = "6942 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "408--420",
booktitle = "Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings",

}

TY - GEN

T1 - Deterministic discrepancy minimization

AU - Bansal, Nikhil

AU - Spencer, Joel

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80052802393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052802393&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23719-5_35

DO - 10.1007/978-3-642-23719-5_35

M3 - Conference contribution

AN - SCOPUS:80052802393

SN - 9783642237188

VL - 6942 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 408

EP - 420

BT - Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings

ER -