scientific article; zbMATH DE number 6783495
From MaRDI portal
Publication:5365142
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (19)
The set splittability problem ⋮ Constructive Discrepancy Minimization by Walking on the Edges ⋮ Approximation-Friendly Discrepancy Rounding ⋮ Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ On generalizations of network design problems with degree bounds ⋮ Discrepancy theory and related algorithms ⋮ $(2+\varepsilon)$-Sat Is NP-hard ⋮ TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES ⋮ Toric algebra of hypergraphs ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ On the Computational Complexity of Linear Discrepancy ⋮ Linear discrepancy is \(\Pi_2\)-hard to approximate ⋮ On splitting and splittable families ⋮ Semidefinite optimization in discrepancy theory ⋮ Unnamed Item ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ Gaussian discrepancy: a probabilistic relaxation of vector balancing ⋮ Algorithmic Aspects of Combinatorial Discrepancy ⋮ Hardness of Rainbow Coloring Hypergraphs
This page was built for publication:
