The following pages link to (Q5501849):
Displayed 12 items.
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Matrix approximation and Tusnády's problem (Q872057) (← links)
- Recent progress on combinatorics and algorithms for low discrepancy roundings (Q2373430) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Constructive Discrepancy Minimization by Walking on the Edges (Q3449569) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
- (Q5743405) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)