{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T01:27:15Z","timestamp":1673314035177},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T00:00:00Z","timestamp":1337212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10107-012-0546-7","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T04:34:26Z","timestamp":1337142866000},"page":"5-22","source":"Crossref","is-referenced-by-count":2,"title":["Semidefinite optimization in discrepancy theory"],"prefix":"10.1007","volume":"134","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,17]]},"reference":[{"key":"546_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon N., Spencer J.H.: The Probabilistic Method. 2nd edn. Wiley, New York (2000)","edition":"2"},{"issue":"4","key":"546_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<351::AID-RSA3>3.0.CO;2-S","volume":"12","author":"W. Banaszczyk","year":"1998","unstructured":"Banaszczyk W.: Balancing vectors and gaussian measures of n-dimensional convex bodies. Random Struct. Algorithms 12(4), 351\u2013360 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"546_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N.: Constructive algorithms for discrepancy minimization. In: Foundations of Computer Science (FOCS), pp. 3\u201310 (2010)","DOI":"10.1109\/FOCS.2010.7"},{"key":"546_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Spencer, J.: Deterministic discrepancy minimization. In: ESA, pp. 408\u2013420 (2011)","DOI":"10.1007\/978-3-642-23719-5_35"},{"key":"546_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF02579452","volume":"1","author":"J. Beck","year":"1981","unstructured":"Beck J.: Roth\u2019s estimate on the discrepancy of integer sequences is nearly sharp. Combinatorica 1, 319\u2013325 (1981)","journal-title":"Combinatorica"},{"key":"546_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","volume":"3","author":"J. Beck","year":"1981","unstructured":"Beck J., Fiala T.: Integer-making theorems. Discret. Appl. Math. 3, 1\u20138 (1981)","journal-title":"Discret. Appl. Math."},{"key":"546_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01196138","volume":"17","author":"D. Bednarchak","year":"1997","unstructured":"Bednarchak D., Helm M.: A note on the beck-fiala theorem. Combinatorica 17, 147\u2013149 (1997)","journal-title":"Combinatorica"},{"key":"546_CR8","unstructured":"Chandrasekaran, K., Vempala, S.: A discrepancy based approach to integer programming. Arxiv 1111.4649 (2011)"},{"key":"546_CR9","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1137\/1.9781611973082.124"},{"key":"546_CR10","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2001","unstructured":"Chazelle B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2001)"},{"issue":"4","key":"546_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1017\/S0963548300004272","volume":"9","author":"B. Doerr","year":"2000","unstructured":"Doerr B.: Linear and hereditary discrepancy. Combin. Probab. Comput. 9(4), 349\u2013354 (2000)","journal-title":"Combin. Probab. Comput."},{"key":"546_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093404","volume-title":"Sequences, Discrepancies and Applications","author":"M. Drmota","year":"1997","unstructured":"Drmota M., Tichy R.F.: Sequences, Discrepancies and Applications. Springer, Berlin (1997)"},{"key":"546_CR13","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., P\u00e1lv\u00f6lgyi, D., Rothvoss, T.: Bin packing via discrepancy of permutations. In: Symposium on Discrete Algorithms (SODA), pp. 476\u2013481 (2011)","DOI":"10.1137\/1.9781611973082.38"},{"key":"546_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22015-9","volume-title":"Approximation Algorithms and Semidefinite Programming","author":"B. G\u00e4rtner","year":"2012","unstructured":"G\u00e4rtner B., Matou\u0161ek J.: Approximation Algorithms and Semidefinite Programming. Springer, Berlin (2012)"},{"key":"546_CR15","first-page":"1191","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri A.: Caracterisation des matrices totalement unimodularies. Comptes Rendus Hebdomadaires des Seances de l\u2019Academie des Sciences 254, 1191\u20131194 (1962)","journal-title":"Comptes Rendus Hebdomadaires des Seances de l\u2019Academie des Sciences"},{"key":"546_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P. Haxell","year":"1995","unstructured":"Haxell P.: A condition for matchability in hypergraphs. Graphs Combin. 11, 245\u2013248 (1995)","journal-title":"Graphs Combin."},{"issue":"4","key":"546_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00493-005-0030-x","volume":"25","author":"J.H. Kim","year":"2005","unstructured":"Kim J.H., Matou\u0161ek J., Vu V.: Discrepancy after adding a single set. Combinatorica 25(4), 499\u2013501 (2005)","journal-title":"Combinatorica"},{"key":"546_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0195-6698(86)80041-5","volume":"7","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Spencer J., Vesztergombi K.: Discrepancy of set-systems and matrices. Eur. J. Combin. 7, 151\u2013160 (1986)","journal-title":"Eur. J. Combin."},{"key":"546_CR19","unstructured":"Matou\u0161ek, J.: The determinant bound for discrepancy is almost tight. Manuscript, Arxiv 1101:0767"},{"key":"546_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/eujc.1997.0162","volume":"19","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek J.: An lp version of the beck-fiala conjecture. Eur. J. Combin. 19, 175\u2013182 (1998)","journal-title":"Eur. J. Combin."},{"key":"546_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An Illustrated Guide","author":"J. Matou\u0161ek","year":"2010","unstructured":"Matou\u0161ek J.: Geometric Discrepancy: An Illustrated Guide. Springer, Berlin (2010)"},{"key":"546_CR22","doi-asserted-by":"crossref","unstructured":"Moser, R.A.: A constructive proof of the lov\u00e1sz local lemma. In: Symposium on Theory of Computering (STOC), pp. 343\u2013350 (2009)","DOI":"10.1145\/1536414.1536462"},{"key":"546_CR23","unstructured":"Newman, A., Nikolov, A.: A counterexample to beck\u2019s conjecture on the discrepancy of three permutations. Arxiv 1104.2922 (2011)"},{"key":"546_CR24","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s00454-009-9194-y","volume":"44","author":"D. P\u00e1lv\u00f6lgyi","year":"2010","unstructured":"P\u00e1lv\u00f6lgyi D.: Indecomposable coverings with concave polygons. Discret. Comput. Geom. 44, 577\u2013588 (2010)","journal-title":"Discret. Comput. Geom."},{"key":"546_CR25","doi-asserted-by":"crossref","unstructured":"Rothvoss, T.: The entropy rounding method in approximation algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 356\u2013372 (2012)","DOI":"10.1137\/1.9781611973099.32"},{"issue":"2","key":"546_CR26","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","volume":"289","author":"J. Spencer","year":"1985","unstructured":"Spencer J.: Six standard deviations suffice. Trans. Am. Math. Soc. 289(2), 679\u2013706 (1985)","journal-title":"Trans. Am. Math. Soc."},{"key":"546_CR27","unstructured":"Srinivasan, A.: Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. In: Symposium on Discrete Algorithms (SODA), pp. 692\u2013701 (1997)"},{"key":"546_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe L., Boyd S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0546-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0546-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10107-012-0546-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0546-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T19:49:56Z","timestamp":1561751396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0546-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,17]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["546"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0546-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,17]]}}}