An algorithm for komlós conjecture matching Banaszczyk's bound

Nikhil Bansal, Daniel Dadush, Shashwat Garg

Research output: Contribution to journalArticleAcademicpeer-review

9 Citations (Scopus)
54 Downloads (Pure)


We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets. We give an efficient algorithm that finds a coloring with discrepancy O((tlog n) 1 / 2 ), matching the best known nonconstructive bound for the problem due to Banaszczyk. The previous algorithms only achieved an O(t 1 / 2 log n) bound. The result also extends to the more general Komlós setting and gives an algorithmic O(log 1 / 2 n) bound.

Original languageEnglish
Pages (from-to)534-553
Number of pages20
JournalSIAM Journal on Computing
Issue number2
Publication statusPublished - 30 Apr 2019


  • Discrepancy
  • Random walk
  • Semidefinite programming
  • semidefinite programming
  • random walk
  • discrepancy


Dive into the research topics of 'An algorithm for komlós conjecture matching Banaszczyk's bound'. Together they form a unique fingerprint.

Cite this