Vector Balancing in Polynomial Time
cs.DS, math.CO
Submitted: 2026-09-20
Updated: 2026-11-03
Terminology
Sources
- Discrepancy Minimization via a Self-Balancing Walk
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
- Constructive Algorithms for Discrepancy Minimization
- Algorithmic Discrepancy Beyond Partial Coloring
- An Improved Bound for the Beck-Fiala Conjecture
- Decoupling via Affine Spectral-Independence: Beck-Fiala and Koml'os Bounds Beyond Banaszczyk
- A Unified Approach to Discrepancy Minimization
- Discrepancy Theory: An Algorithmic and Geometric Perspective
- Online balancing of vectors with small coordinates
- Optimal Online Discrepancy Minimization
- Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
- Spectral Sparsification by Deterministic Discrepancy Walk
- Discrepancy Minimization via Regularization
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time