Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method

@article{Levy2017DeterministicDM,
  title={Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method},
  author={Avi Levy and Harishchandra Ramadas and Thomas Rothvoss},
  journal={ArXiv},
  year={2017},
  volume={abs/1611.08752}
}
  • Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
  • Published in IPCO 2017
  • Mathematics, Computer Science
  • ArXiv
  • A well-known theorem of Spencer shows that any set system with n sets over n elements admits a coloring of discrepancy \(O(\sqrt{n})\). While the original proof was non-constructive, recent progress brought polynomial time algorithms by Bansal, Lovett and Meka, and Rothvoss. All those algorithms are randomized, even though Bansal’s algorithm admitted a complicated derandomization. 

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 22 CITATIONS

    Algorithms to Approximate Column-sparse Packing Problems

    VIEW 14 EXCERPTS
    CITES RESULTS
    HIGHLY INFLUENCED

    On the discrepancy of random low degree set systems

    VIEW 1 EXCERPT
    CITES RESULTS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES

    Constructive Discrepancy Minimization by Walking on the Edges

    • Shachar Lovett, Raghu Meka
    • Mathematics, Computer Science
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Constructive Algorithms for Discrepancy Minimization

    • Nikhil Bansal
    • Mathematics, Computer Science
    • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
    • 2010
    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    "Integer-making" theorems

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Algorithmica

    • Nikhil Bansal, Joel Spencer. Deterministic discrepancy minimization
    • 67(4):451– 471,
    • 2013
    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Six standard deviations suffice

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound

    ArXiv e-prints

    • A. Nikolov. The Komlos Conjecture Holds for Vector Colorings
    • January
    • 2013
    VIEW 1 EXCERPT