{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T01:05:15Z","timestamp":1786496715035,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746628","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"861-870","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Randomized Rounding for the Largest Simplex Problem"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Nikolov","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"e_1_3_2_1_2_1","volume-title":"Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis. Israel journal of mathematics, 57(2):137--224","author":"Bourgain J.","year":"1987"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9582-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"e_1_3_2_1_6_1","volume-title":"On largest","author":"Summa M. Di","year":"2014"},{"key":"e_1_3_2_1_7_1","first-page":"1192","article-title":"Caract\u00e9risation des matrices totalement unimodulaires","volume":"254","author":"Ghouila-Houri A.","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"e_1_3_2_1_8_1","series-title":"Contemp","first-page":"47","volume-title":"Structured matrices in mathematics, computer science, and engineering","author":"Goreinov S. A.","year":"1999"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00111-U"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574058"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095211"},{"key":"e_1_3_2_1_13_1","first-page":"187","volume-title":"Studies and Essays Presented to R. Courant on his 60th Birthday","author":"John F.","year":"1948"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1995.1005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.2.307"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.05.006"},{"key":"e_1_3_2_1_17_1","article-title":"The convex analysis of unitarily invariant matrix functions","author":"Lewis A. S.","year":"1995","journal-title":"J. Convex Anal., 2(1--2):173--183"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(86)80041-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0162"},{"key":"e_1_3_2_1_20_1","unstructured":"J. Matousek. The determinant bound for discrepancy is almost tight. http:\/\/arxiv.org\/abs\/1101.0767 2011.  J. Matousek. The determinant bound for discrepancy is almost tight. http:\/\/arxiv.org\/abs\/1101.0767 2011."},{"key":"e_1_3_2_1_21_1","volume-title":"Approximating discrepancy via small width ellipsoids. To appear in SODA '15","author":"Nikolov A.","year":"2014"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00226-9"},{"key":"e_1_3_2_1_24_1","volume-title":"No. 28","author":"Rockafellar R. T.","year":"1970"},{"key":"e_1_3_2_1_25_1","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"Schrijver A.","year":"2003"},{"key":"e_1_3_2_1_26_1","first-page":"9","article-title":"\u00dcber eine Klasse von Mittelbildungen mit Anwendungen auf die Determinantentheorie","volume":"22","author":"Schur I.","year":"1923","journal-title":"Sitzungsber. Berl. Math. Ges."},{"key":"e_1_3_2_1_27_1","first-page":"692","volume-title":"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Srinivasan A.","year":"1997"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746628","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:00Z","timestamp":1750227420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":27,"alternative-id":["10.1145\/2746539.2746628","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746628","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}