{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:31Z","timestamp":1750306351061,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"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":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897649","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"192-201","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Maximizing determinants under partition constraints"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Nikolov","sequence":"first","affiliation":[{"name":"University of Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00618-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.018"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9582-6"},{"key":"e_1_3_2_1_6_1","volume-title":"Geometric programming: theory and application","author":"Duffin R. J.","year":"1967","unstructured":"R. J. Duffin , E. L. Peterson , and C. Zener . Geometric programming: theory and application . Wiley New York , 1967 . R. J. Duffin, E. L. Peterson, and C. Zener. Geometric programming: theory and application. Wiley New York, 1967."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(81)90044-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01163285"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.46"},{"issue":"3","key":"e_1_3_2_1_10_1","first-page":"355","article-title":"The Brunn-Minkowski inequality. Bull. Amer. Math. Soc. (N.","volume":"39","author":"Gardner R. J.","year":"2002","unstructured":"R. J. Gardner . The Brunn-Minkowski inequality. Bull. Amer. Math. Soc. (N. S.) , 39 ( 3 ): 355 \u2013 405 , 2002 . R. J. Gardner. The Brunn-Minkowski inequality. Bull. Amer. Math. Soc. (N.S.), 39(3):355\u2013405, 2002.","journal-title":"S.)"},{"key":"e_1_3_2_1_11_1","first-page":"2743","volume-title":"Advances in Neural Information Processing Systems","author":"Gillenwater J.","year":"2012","unstructured":"J. Gillenwater , A. Kulesza , and B. Taskar . Near-optimal map inference for determinantal point processes . In Advances in Neural Information Processing Systems , pages 2735\u2013 2743 , 2012 . J. Gillenwater, A. Kulesza, and B. Taskar. Near-optimal map inference for determinantal point processes. In Advances in Neural Information Processing Systems, pages 2735\u20132743, 2012."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132578"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.37236\/790"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335311"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1995.1005"},{"issue":"6","key":"e_1_3_2_1_17_1","first-page":"1332","article-title":"Analogues of Aleksandrov-Fenchel inequalities for hyperbolic forms","volume":"276","author":"Khovanskii A. G.","year":"1984","unstructured":"A. G. Khovanskii . Analogues of Aleksandrov-Fenchel inequalities for hyperbolic forms . Dokl. Akad. Nauk SSSR , 276 ( 6 ): 1332 \u2013 1334 , 1984 . A. G. Khovanskii. Analogues of Aleksandrov-Fenchel inequalities for hyperbolic forms. Dokl. Akad. Nauk SSSR, 276(6):1332\u20131334, 1984.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.4.684"},{"key":"e_1_3_2_1_19_1","first-page":"1179","volume-title":"Advances in neural information processing systems","author":"Kulesza A.","year":"2010","unstructured":"A. Kulesza and B. Taskar . Structured determinantal point processes . In Advances in neural information processing systems , pages 1171\u2013 1179 , 2010 . A. Kulesza and B. Taskar. Structured determinantal point processes. In Advances in neural information processing systems, pages 1171\u20131179, 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986290"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4169\/000298910x523380"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.5.655"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536459"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"173","article-title":"The convex analysis of unitarily invariant matrix functions","volume":"2","author":"Lewis A. S.","year":"1995","unstructured":"A. S. Lewis . The convex analysis of unitarily invariant matrix functions . J. Convex Anal. , 2 ( 1-2 ): 173 \u2013 183 , 1995 . A. S. Lewis. The convex analysis of unitarily invariant matrix functions. J. Convex Anal., 2(1-2):173\u2013183, 1995.","journal-title":"J. Convex Anal."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10240-003-0016-0"},{"key":"e_1_3_2_1_26_1","volume-title":"Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem. arXiv preprint arXiv:1306.3969","author":"Marcus A.","year":"2013","unstructured":"A. Marcus , D. A. Spielman , and N. Srivastava . Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem. arXiv preprint arXiv:1306.3969 , 2013 . A. Marcus, D. A. Spielman, and N. Srivastava. Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem. arXiv preprint arXiv:1306.3969, 2013."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1957-037-9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091500021921"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746628"},{"key":"e_1_3_2_1_31_1","volume-title":"arXiv preprint arXiv:1210.3231","author":"Pemantle R.","year":"2012","unstructured":"R. Pemantle . Hyperbolicity and stable polynomials in combinatorics and probability. arXiv preprint arXiv:1210.3231 , 2012 . R. Pemantle. Hyperbolicity and stable polynomials in combinatorics and probability. arXiv preprint arXiv:1210.3231, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526282"},{"key":"e_1_3_2_1_33_1","volume-title":"On largest","author":"Summa M. D.","year":"2015","unstructured":"M. D. Summa , F. Eisenbrand , Y. Faenza , and C. Moldenhauer . On largest volume simplices and sub-determinants. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 315\u2013 323 . SIAM , 2015 . M. D. Summa, F. Eisenbrand, Y. Faenza, and C. Moldenhauer. On largest volume simplices and sub-determinants. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 315\u2013323. SIAM, 2015."},{"key":"e_1_3_2_1_34_1","volume-title":"Zeros of polynomials and their applications to theory: a primer","author":"Vishnoi N. K.","year":"2013","unstructured":"N. K. Vishnoi . Zeros of polynomials and their applications to theory: a primer . 2013 . N. K. Vishnoi. Zeros of polynomials and their applications to theory: a primer. 2013."}],"event":{"name":"STOC '16: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge MA USA","acronym":"STOC '16"},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:58Z","timestamp":1750222558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":34,"alternative-id":["10.1145\/2897518.2897649","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897649","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}