Constructive Discrepancy Minimization for Convex Sets
From MaRDI portal
Publication:2968153
DOI10.1137/141000282zbMath1359.52009arXiv1404.0339OpenAlexW2593701861MaRDI QIDQ2968153
Publication date: 10 March 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.0339
Computational aspects related to convexity (52B55) Extremal set theory (05D05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (7)
Approximation-Friendly Discrepancy Rounding ⋮ Quantum discrepancy: a non-commutative version of combinatorial discrepancy ⋮ Algorithmic pure states for the negative spherical perceptron ⋮ The discrepancy of random rectangular matrices ⋮ Algorithmic obstructions in the random number partitioning problem ⋮ Gaussian discrepancy: a probabilistic relaxation of vector balancing ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability in Banach spaces. Isoperimetry and processes
- ``Integer-making theorems
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- The ellipsoid method and its consequences in combinatorial optimization
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Constructive Discrepancy Minimization by Walking on the Edges
- Six Standard Deviations Suffice
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- On the discrepancy of 3 permutations
- On some vector balancing problems
- Efficient algorithms for discrepancy minimization in convex sets
- On Certain Inequalities for Normal Distributions and their Applications to Simultaneous Confidence Bounds
- Rectangular Confidence Regions for the Means of Multivariate Normal Distributions
- Geometric discrepancy. An illustrated guide
This page was built for publication: Constructive Discrepancy Minimization for Convex Sets
