{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:54Z","timestamp":1725603654092},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_35","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"408-420","source":"Crossref","is-referenced-by-count":3,"title":["Deterministic Discrepancy Minimization"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Joel","family":"Spencer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley, Chichester (2000)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N.: Constructive algorithm for discrepancy minimization. In: FOCS 2010 (2010)","DOI":"10.1109\/FOCS.2010.7"},{"key":"35_CR3","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\u00a01, 319\u2013325 (1981)","journal-title":"Combinatorica"},{"key":"35_CR4","first-page":"1405","volume-title":"Handbook of Combinatorics","author":"J. Beck","year":"1995","unstructured":"Beck, J., Sos, V.: Discrepancy theory. In: Graham, R.L., Grotschel, M., Lovasz, L. (eds.) Handbook of Combinatorics, pp. 1405\u20131446. North-Holland, Amsterdam (1995)"},{"key":"35_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The discrepancy method: randomness and complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The discrepancy method: randomness and complexity. Cambridge University Press, Cambridge (2000)"},{"key":"35_CR6","unstructured":"Engebretsen, L., Indyk, P., O\u2019Donnell, R.: Derandomized dimensionality reduction with applications. In: SODA 2002, pp. 705\u2013712 (2002)"},{"issue":"4","key":"35_CR7","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., Matousek, J., Vu, V.H.: Discrepancy After Adding A Single Set. Combinatorica\u00a025(4), 499\u2013501 (2005)","journal-title":"Combinatorica"},{"key":"35_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An Illustrated Guide, Algorithms and Combinatorics","author":"J. Matousek","year":"1999","unstructured":"Matousek, J.: Geometric Discrepancy: An Illustrated Guide, Algorithms and Combinatorics, vol.\u00a018. Springer, Heidelberg (1999)"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/eujc.1997.0162","volume":"19","author":"J. Matousek","year":"1998","unstructured":"Matousek, J.: An Lp version of the Beck-Fiala conjecture. European Journal of Combinatorics\u00a019(2), 175\u2013182 (1998)","journal-title":"European Journal of Combinatorics"},{"issue":"5","key":"35_CR10","doi-asserted-by":"publisher","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.\u00a028(5), 1641\u20131663 (1999)","journal-title":"SIAM J. Comput."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. of Computer and Systems Sciences\u00a037, 130\u2013143","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Spencer, J.: Balancing Games. J.\u00a0Comb.\u00a0Theory, Ser.\u00a0B\u00a023(1), 68\u201374 (1977)","DOI":"10.1016\/0095-8956(77)90057-0"},{"key":"35_CR13","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. Amer. Math. Soc.\u00a0289, 679\u2013706 (1985)","journal-title":"Trans. Amer. Math. Soc."},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Sivakumar, D.: Algorithmic Derandomization via Complexity Theory. In: IEEE Conference on Computational Complexity (2002)","DOI":"10.1145\/509994.509996"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:05Z","timestamp":1560514085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}