Abstract
Recently, there have been several new developments in discrepancy theory based on connections to semidefinite programming. This connection has been useful in several ways. It gives efficient polynomial time algorithms for several problems for which only non-constructive results were previously known. It also leads to several new structural results in discrepancy itself, such as tightness of the so-called determinant lower bound, improved bounds on the discrepancy of the union of set systems and so on. We will give a brief survey of these results, focussing on the main ideas and the techniques involved.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon N., Spencer J.H.: The Probabilistic Method. 2nd edn. Wiley, New York (2000)
Banaszczyk W.: Balancing vectors and gaussian measures of n-dimensional convex bodies. Random Struct. Algorithms 12(4), 351–360 (1998)
Bansal, N.: Constructive algorithms for discrepancy minimization. In: Foundations of Computer Science (FOCS), pp. 3–10 (2010)
Bansal, N., Spencer, J.: Deterministic discrepancy minimization. In: ESA, pp. 408–420 (2011)
Beck J.: Roth’s estimate on the discrepancy of integer sequences is nearly sharp. Combinatorica 1, 319–325 (1981)
Beck J., Fiala T.: Integer-making theorems. Discret. Appl. Math. 3, 1–8 (1981)
Bednarchak D., Helm M.: A note on the beck-fiala theorem. Combinatorica 17, 147–149 (1997)
Chandrasekaran, K., Vempala, S.: A discrepancy based approach to integer programming. Arxiv 1111.4649 (2011)
Charikar, M., Newman, A., Nikolov, A.: Tight hardness results for minimizing discrepancy. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011)
Chazelle B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2001)
Doerr B.: Linear and hereditary discrepancy. Combin. Probab. Comput. 9(4), 349–354 (2000)
Drmota M., Tichy R.F.: Sequences, Discrepancies and Applications. Springer, Berlin (1997)
Eisenbrand, F., Pálvölgyi, D., Rothvoss, T.: Bin packing via discrepancy of permutations. In: Symposium on Discrete Algorithms (SODA), pp. 476–481 (2011)
Gärtner B., Matoušek J.: Approximation Algorithms and Semidefinite Programming. Springer, Berlin (2012)
Ghouila-Houri A.: Caracterisation des matrices totalement unimodularies. Comptes Rendus Hebdomadaires des Seances de l’Academie des Sciences 254, 1191–1194 (1962)
Haxell P.: A condition for matchability in hypergraphs. Graphs Combin. 11, 245–248 (1995)
Kim J.H., Matoušek J., Vu V.: Discrepancy after adding a single set. Combinatorica 25(4), 499–501 (2005)
Lovász L., Spencer J., Vesztergombi K.: Discrepancy of set-systems and matrices. Eur. J. Combin. 7, 151–160 (1986)
Matoušek, J.: The determinant bound for discrepancy is almost tight. Manuscript, Arxiv 1101:0767
Matoušek J.: An lp version of the beck-fiala conjecture. Eur. J. Combin. 19, 175–182 (1998)
Matoušek J.: Geometric Discrepancy: An Illustrated Guide. Springer, Berlin (2010)
Moser, R.A.: A constructive proof of the lovász local lemma. In: Symposium on Theory of Computering (STOC), pp. 343–350 (2009)
Newman, A., Nikolov, A.: A counterexample to beck’s conjecture on the discrepancy of three permutations. Arxiv 1104.2922 (2011)
Pálvölgyi D.: Indecomposable coverings with concave polygons. Discret. Comput. Geom. 44, 577–588 (2010)
Rothvoss, T.: The entropy rounding method in approximation algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 356–372 (2012)
Spencer J.: Six standard deviations suffice. Trans. Am. Math. Soc. 289(2), 679–706 (1985)
Srinivasan, A.: Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. In: Symposium on Discrete Algorithms (SODA), pp. 692–701 (1997)
Vandenberghe L., Boyd S.: Semidefinite programming. SIAM Rev. 38, 49–95 (1996)
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Bansal, N. Semidefinite optimization in discrepancy theory. Math. Program. 134, 5–22 (2012). https://doi.org/10.1007/s10107-012-0546-7
Received:
Accepted:
Published:
Issue date:
DOI: https://doi.org/10.1007/s10107-012-0546-7