Efficient algorithm matches O(sqrt(d)) bound for l2 Steinitz and prefix discrepancy under d >= Omega(log^7 n).
Online geometric discrep- ancy for stochastic arrivals with applications to envy mini mization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
Efficient algorithm matches O(sqrt(d)) bound for l2 Steinitz and prefix discrepancy under d >= Omega(log^7 n).