{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:50:54Z","timestamp":1781077854720,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T00:00:00Z","timestamp":1355529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00453-012-9728-1","type":"journal-article","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T10:37:49Z","timestamp":1355481469000},"page":"451-471","source":"Crossref","is-referenced-by-count":7,"title":["Deterministic Discrepancy Minimization"],"prefix":"10.1007","volume":"67","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joel","family":"Spencer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,12,15]]},"reference":[{"key":"9728_CR1","doi-asserted-by":"crossref","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"},{"key":"9728_CR2","first-page":"3","volume-title":"Foundations of Computer Science, FOCS","author":"N. Bansal","year":"2010","unstructured":"Bansal, N.: Constructive algorithms for discrepancy minimization. In: Foundations of Computer Science, FOCS, pp. 3\u201310 (2010). arXiv:1002.2259"},{"key":"9728_CR3","doi-asserted-by":"crossref","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":"9728_CR4","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":"9728_CR5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1017\/S0963548300004272","volume":"9","author":"B. Doerr","year":"2000","unstructured":"Doerr, B.: Linear and hereditary discrepancy. Comb. Probab. Comput. 9(4), 349\u2013354 (2000)","journal-title":"Comb. Probab. Comput."},{"key":"9728_CR6","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":"9728_CR7","first-page":"705","volume-title":"ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"L. Engebretsen","year":"2002","unstructured":"Engebretsen, L., Indyk, P., O\u2019Donnell, R.: Derandomized dimensionality reduction with applications. In: ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 705\u2013712 (2002)"},{"issue":"4","key":"9728_CR8","doi-asserted-by":"crossref","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.H.: Discrepancy after adding a single set. Combinatorica 25(4), 499\u2013501 (2005)","journal-title":"Combinatorica"},{"key":"9728_CR9","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. Comb. 7, 151\u2013160 (1986)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"9728_CR10","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1137\/S0097539796309326","volume":"28","author":"S. Mahajan","year":"1999","unstructured":"Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28(5), 1641\u20131663 (1999)","journal-title":"SIAM J. Comput."},{"key":"9728_CR11","unstructured":"Matou\u0161ek, J.: The determinant bound for discrepancy is almost tight. Manuscript. arXiv:1101.0767"},{"key":"9728_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/eujc.1997.0162","volume":"19","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J.: An \u2113 p version of the Beck-Fiala conjecture. Eur. J. Comb. 19, 175\u2013182 (1998)","journal-title":"Eur. J. Comb."},{"key":"9728_CR13","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)"},{"issue":"2","key":"9728_CR14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37(2), 130\u2013143 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9728_CR15","first-page":"619","volume-title":"ACM Symposium on Theory of Computing, STOC","author":"D. Sivakumar","year":"2002","unstructured":"Sivakumar, D.: Algorithmic derandomization via complexity theory. In: ACM Symposium on Theory of Computing, STOC, pp. 619\u2013626 (2002)"},{"issue":"1","key":"9728_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90057-0","volume":"23","author":"J. Spencer","year":"1977","unstructured":"Spencer, J.: Balancing games. J. Comb. Theory, Ser. B 23(1), 68\u201374 (1977)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"9728_CR17","doi-asserted-by":"crossref","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."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9728-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9728-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9728-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:11Z","timestamp":1559123111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9728-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,15]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9728"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9728-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,15]]}}}