Efficient algorithms for discrepancy minimization in convex sets

DOI10.1002/rsa.20763zbMath1410.90121arXiv1409.2913OpenAlexW2963978809MaRDI QIDQ4684830

Mohit Singh, Ronen Eldan

Publication date: 25 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.2913

zbMATH Keywords

rounding algorithmscombinatorial discrepancy theory

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (7)

The discrepancy of random rectangular matrices ⋮ Vector balancing in Lebesgue spaces ⋮ Discrepancy theory and related algorithms ⋮ Constructive Discrepancy Minimization for Convex Sets ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ Gaussian discrepancy: a probabilistic relaxation of vector balancing ⋮ Unnamed Item

This page was built for publication: Efficient algorithms for discrepancy minimization in convex sets