Semidefinite optimization in discrepancy theory

DOI10.1007/s10107-012-0546-7zbMath1254.90152OpenAlexW1980879487MaRDI QIDQ715251

Michael Martin Nikhil Bansal

Publication date: 2 November 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0546-7

zbMATH Keywords

algorithmsdiscrepancy theoryrounding error

Mathematics Subject Classification ID

Semidefinite programming (90C22) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indecomposable coverings with concave polygons
• Sequences, discrepancies and applications
• Discrepancy of set-systems and matrices
• ``Integer-making theorems
• Roth's estimate of the discrepancy of integer sequences is nearly sharp
• An \(L_p\) version of the Beck-Fiala conjecture
• A note on the Beck-Fiala theorem
• A condition for matchability in hypergraphs
• Discrepancy after adding a single set
• Linear and Hereditary Discrepancy
• Bin Packing via Discrepancy of Permutations
• Deterministic Discrepancy Minimization
• Six Standard Deviations Suffice
• Semidefinite Programming
• A constructive proof of the Lovász local lemma
• Geometric discrepancy. An illustrated guide

This page was built for publication: Semidefinite optimization in discrepancy theory