Semidefinite optimization in discrepancy theory

DOI10.1007/S10107-012-0546-7MaRDI QIDQ715251zbMATH OpenOpenAlexFDO

Authors Michael Martin Nikhil Bansal

Publication date 2 November 2012

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Algorithmic aspects of combinatorial discrepancy
• The determinant bound for discrepancy is almost tight
• Deterministic discrepancy minimization
• Constructive discrepancy minimization by walking on the edges
• Efficient algorithms for discrepancy minimization in convex sets

Cites work

• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• scientific article; zbMATH DE number 1380581 (Why is no real title available?)
• scientific article; zbMATH DE number 6472647 (Why is no real title available?)
• scientific article; zbMATH DE number 3185974 (Why is no real title available?)
• A condition for matchability in hypergraphs
• A constructive proof of the Lovász local lemma
• A note on the Beck-Fiala theorem
• An \(L_p\) version of the Beck-Fiala conjecture
• Deterministic discrepancy minimization
• Discrepancy after adding a single set
• Discrepancy of set-systems and matrices
• Geometric discrepancy. An illustrated guide
• Indecomposable coverings with concave polygons
• Linear and hereditary discrepancy
• Roth's estimate of the discrepancy of integer sequences is nearly sharp
• Semidefinite Programming
• Sequences, discrepancies and applications
• Six Standard Deviations Suffice
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Tight hardness results for minimizing discrepancy
• ``Integer-making theorems

Cited in

(4)

• scientific article; zbMATH DE number 1836463 (Why is no real title available?)
• Empirical Properties of Optima in Free Semidefinite Programs
• Semidefinite relaxations of dynamical programs under discrete constraints
• Algorithmic aspects of combinatorial discrepancy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715251)