Publication:5365142
From MaRDI portal
zbMath1373.68236MaRDI QIDQ5365142
Alantha Newman, Aleksandar Nikolov, Moses Charikar
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133160
68Q25: Analysis of algorithms and problem complexity
05D05: Extremal set theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES, An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound, Unnamed Item, On splitting and splittable families, Algorithmic Aspects of Combinatorial Discrepancy, Hardness of Rainbow Coloring Hypergraphs, The set splittability problem, $(2+\varepsilon)$-Sat Is NP-hard, On the Computational Complexity of Linear Discrepancy, Discrepancy theory and related algorithms, On generalizations of network design problems with degree bounds, Semidefinite optimization in discrepancy theory, Gaussian discrepancy: a probabilistic relaxation of vector balancing, Almost envy-freeness for groups: improved bounds via discrepancy theory, Linear discrepancy is \(\Pi_2\)-hard to approximate, Toric algebra of hypergraphs, The Geometry of Differential Privacy: The Small Database and Approximate Cases, Approximation-Friendly Discrepancy Rounding, Constructive Discrepancy Minimization by Walking on the Edges
