{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:30Z","timestamp":1725488610338},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44669-9_53","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"461-471","source":"Crossref","is-referenced-by-count":2,"title":["Structured Randomized Rounding and Coloring"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 2nd edition2000.","DOI":"10.1002\/0471722154"},{"key":"53_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","volume":"3","author":"J. Beck","year":"1981","unstructured":"J. Beck and T. Fiala. \u201cInteger making\u201d theorems. Discrete Applied Mathematics, 3:1\u20138, 1981.","journal-title":"Discrete Applied Mathematics"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"L. Babai, T. P. Hayes, and P. G. Kimmel. The cost of the missing bit: Communication complexity with help. In Proceedings of the 30th STOC, pages 673\u2013682, 1998.","DOI":"10.1145\/276698.276883"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02591800","volume":"30","author":"J. Beck","year":"1984","unstructured":"J. Beck and J. Spencer. Integral approximation sequences. Math. Programming, 30:88\u201398, 1984.","journal-title":"Math. Programming"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"B. Chazelle. The Discrepancy Method. Princeton University, 2000.","DOI":"10.1017\/CBO9780511626371"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","volume":"25","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal. The tail of the hypergeometric distribution. Discrete Math., 25:285\u2013287, 1979.","journal-title":"Discrete Math."},{"key":"53_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-44693-1_16","volume-title":"Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2001","author":"B. Doerr","year":"2001","unstructured":"B. Doerr and A. Srivastav. Recursive randomized coloring beats fair dice random colorings. In A. Ferreira and H. Reichel, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2001, volume 2010 of Lecture Notes in Computer Science, pages 183\u2013194, Berlin-Heidelberg, 2001. Springer Verlag."},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0195-6698(86)80041-5","volume":"7","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz, J. Spencer, and K. Vesztergombi. Discrepancies of set-systems and matrices. Europ. J. Combin., 7:151\u2013160, 1986.","journal-title":"Europ. J. Combin."},{"key":"53_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J. Matou\u0161ek","year":"1999","unstructured":"J. Matou\u0161ek. Geometric Discrepancy. Springer-Verlag, Berlin, 1999."},{"key":"53_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4064\/aa-9-3-257-260","volume":"9","author":"K. F. Roth","year":"1964","unstructured":"K. F. Roth. Remark concerning integer sequences. Acta Arithmetica, 9:257\u2013260, 1964.","journal-title":"Acta Arithmetica"},{"key":"53_CR11","unstructured":"A. Srinivasan. An extension of the Lov\u00e1sz local lemma, and its applications to integer programming. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), pages 6\u201315, New York, 1996. ACM."},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"A. Srivastav. Derandomization in combinatorial optimization. In P. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, editors, Handbook of Randomization. Kluver, to appear in 2001.","DOI":"10.1007\/978-1-4615-0013-1_18"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J. P. Schmidt","year":"1995","unstructured":"J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8:223\u2013250, 1995.","journal-title":"SIAM J. Discrete Math."},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02613425","volume":"10","author":"W. Uhlmann","year":"1966","unstructured":"W. Uhlmann. Vergleich der hypergeometrischen mit der Binomial-Verteilung. Metrika, 10:145\u2013158, 1966.","journal-title":"Metrika"},{"key":"53_CR15","first-page":"212","volume":"15","author":"B. L. Waerden van der","year":"1927","unstructured":"B. L. van der Waerden. Beweis einer Baudetschen Vermutung. Nieuw Arch. Wsk., 15:212\u2013216, 1927.","journal-title":"Nieuw Arch. Wsk."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:24Z","timestamp":1605647184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540424871"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_53","relation":{},"subject":[]}}